java -ea -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:06:36,280 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:36,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:36,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:36,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:36,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:36,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:36,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:36,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:36,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:36,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:36,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:36,304 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:36,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:36,306 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:36,307 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:36,308 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:36,309 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:36,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:36,313 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:36,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:36,315 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:36,317 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:36,317 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:36,317 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:36,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:36,319 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:36,320 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:36,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:36,322 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:36,322 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:36,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:36,323 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:36,323 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:36,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:36,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:36,325 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:06:36,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:36,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:36,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:06:36,341 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:06:36,341 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:36,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:36,342 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:36,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:36,342 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:06:36,342 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:36,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:06:36,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:36,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:06:36,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:06:36,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:06:36,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:06:36,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:36,344 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:36,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:06:36,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:36,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:36,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:06:36,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:06:36,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:36,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:36,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:06:36,346 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:06:36,346 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:36,346 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:06:36,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:06:36,347 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:06:36,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:36,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:36,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:36,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:36,427 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:36,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i [2018-11-23 13:06:36,487 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e885ee/2f50ea6545b24ae5824c7e7dc770e952/FLAG2267ffd87 [2018-11-23 13:06:36,955 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:36,956 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i [2018-11-23 13:06:36,961 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e885ee/2f50ea6545b24ae5824c7e7dc770e952/FLAG2267ffd87 [2018-11-23 13:06:37,293 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e885ee/2f50ea6545b24ae5824c7e7dc770e952 [2018-11-23 13:06:37,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:37,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:37,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:37,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:37,312 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:37,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f68b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37, skipping insertion in model container [2018-11-23 13:06:37,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:37,356 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:37,603 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:37,608 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:37,631 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:37,654 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:37,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37 WrapperNode [2018-11-23 13:06:37,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:37,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:37,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:37,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:37,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:37,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:37,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:37,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:37,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (1/1) ... [2018-11-23 13:06:37,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:37,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:37,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:37,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:37,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (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 [2018-11-23 13:06:37,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:06:37,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:06:37,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:06:37,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:06:37,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:37,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:37,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:06:37,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:06:37,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:06:37,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:06:37,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:06:37,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:06:38,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:38,278 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:06:38,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:38 BoogieIcfgContainer [2018-11-23 13:06:38,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:38,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:06:38,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:06:38,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:06:38,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:06:37" (1/3) ... [2018-11-23 13:06:38,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7843ab8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:38, skipping insertion in model container [2018-11-23 13:06:38,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:37" (2/3) ... [2018-11-23 13:06:38,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7843ab8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:38, skipping insertion in model container [2018-11-23 13:06:38,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:38" (3/3) ... [2018-11-23 13:06:38,291 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call1_true-termination.i [2018-11-23 13:06:38,302 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:06:38,313 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:06:38,330 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:06:38,364 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:38,365 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:06:38,366 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:06:38,366 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:06:38,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:38,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:38,366 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:06:38,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:38,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:06:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:06:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:06:38,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:38,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:38,397 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:38,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2018-11-23 13:06:38,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:38,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:38,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:38,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:38,548 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:06:38,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24#true} is VALID [2018-11-23 13:06:38,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:06:38,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2018-11-23 13:06:38,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-23 13:06:38,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {24#true} is VALID [2018-11-23 13:06:38,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:06:38,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {25#false} is VALID [2018-11-23 13:06:38,556 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {25#false} is VALID [2018-11-23 13:06:38,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:06:38,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:06:38,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:06:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:38,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:38,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:06:38,568 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:06:38,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:38,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:06:38,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:38,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:06:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:06:38,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:06:38,636 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:06:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:38,731 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 13:06:38,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:06:38,731 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:06:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:06:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 13:06:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:06:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 13:06:38,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-23 13:06:39,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:39,098 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:06:39,098 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:06:39,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:06:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:06:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:06:39,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:39,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:39,240 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:39,240 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:39,245 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:39,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:39,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:39,246 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:39,247 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:39,253 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:39,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:39,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:39,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:39,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:06:39,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:06:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:39,261 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:06:39,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:06:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:06:39,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:39,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:39,263 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:39,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:39,263 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2018-11-23 13:06:39,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:39,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:39,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:39,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:39,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {120#true} is VALID [2018-11-23 13:06:39,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {120#true} is VALID [2018-11-23 13:06:39,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {120#true} assume true; {120#true} is VALID [2018-11-23 13:06:39,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} #35#return; {120#true} is VALID [2018-11-23 13:06:39,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {120#true} call #t~ret2 := main(); {120#true} is VALID [2018-11-23 13:06:39,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {122#(= main_~i~0 0)} is VALID [2018-11-23 13:06:39,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {122#(= main_~i~0 0)} assume !(~i~0 < 1024); {121#false} is VALID [2018-11-23 13:06:39,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {121#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {121#false} is VALID [2018-11-23 13:06:39,375 INFO L256 TraceCheckUtils]: 8: Hoare triple {121#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {121#false} is VALID [2018-11-23 13:06:39,376 INFO L273 TraceCheckUtils]: 9: Hoare triple {121#false} ~cond := #in~cond; {121#false} is VALID [2018-11-23 13:06:39,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {121#false} assume 0 == ~cond; {121#false} is VALID [2018-11-23 13:06:39,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {121#false} assume !false; {121#false} is VALID [2018-11-23 13:06:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:39,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:39,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:06:39,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:06:39,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:39,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:06:39,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:39,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:06:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:06:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:39,438 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-23 13:06:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:39,547 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:06:39,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:06:39,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:06:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:06:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:06:39,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-23 13:06:39,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:39,721 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:06:39,722 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:06:39,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:06:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:06:39,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:39,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:06:39,738 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:06:39,738 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:06:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:39,740 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:39,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:39,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:39,741 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:06:39,741 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:06:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:39,743 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:39,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:39,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:39,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:39,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:06:39,746 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 13:06:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:39,747 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:06:39,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:06:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:06:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:06:39,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:39,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:39,748 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:39,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2018-11-23 13:06:39,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:39,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:39,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:39,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:39,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:39,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 13:06:39,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-23 13:06:39,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 13:06:39,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #35#return; {212#true} is VALID [2018-11-23 13:06:39,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret2 := main(); {212#true} is VALID [2018-11-23 13:06:39,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {214#(= main_~i~0 0)} is VALID [2018-11-23 13:06:39,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {214#(= main_~i~0 0)} is VALID [2018-11-23 13:06:39,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:39,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 1)} assume !(~i~0 < 1024); {213#false} is VALID [2018-11-23 13:06:39,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {213#false} is VALID [2018-11-23 13:06:39,872 INFO L256 TraceCheckUtils]: 10: Hoare triple {213#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {213#false} is VALID [2018-11-23 13:06:39,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 13:06:39,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-23 13:06:39,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 13:06:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:39,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:39,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-23 13:06:39,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:39,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:40,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 13:06:40,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-23 13:06:40,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 13:06:40,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #35#return; {212#true} is VALID [2018-11-23 13:06:40,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret2 := main(); {212#true} is VALID [2018-11-23 13:06:40,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {234#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:40,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {234#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:40,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:40,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 1)} assume !(~i~0 < 1024); {213#false} is VALID [2018-11-23 13:06:40,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {213#false} is VALID [2018-11-23 13:06:40,062 INFO L256 TraceCheckUtils]: 10: Hoare triple {213#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {213#false} is VALID [2018-11-23 13:06:40,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 13:06:40,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-23 13:06:40,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 13:06:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:40,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:40,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:06:40,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:06:40,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:40,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:06:40,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:40,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:06:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:06:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:40,164 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 13:06:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:40,578 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:06:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:06:40,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:06:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:06:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:06:40,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2018-11-23 13:06:40,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:40,675 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:06:40,675 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:06:40,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:06:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 13:06:40,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:40,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-23 13:06:40,731 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-23 13:06:40,731 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-23 13:06:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:40,733 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:06:40,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:40,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:40,734 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-23 13:06:40,735 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-23 13:06:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:40,736 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:06:40,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:40,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:40,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:40,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:06:40,739 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 13:06:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:40,740 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:06:40,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:06:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:06:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:06:40,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:40,741 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:40,741 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:40,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2018-11-23 13:06:40,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:40,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:40,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:40,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:40,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 13:06:40,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 13:06:40,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 13:06:40,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #35#return; {355#true} is VALID [2018-11-23 13:06:40,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret2 := main(); {355#true} is VALID [2018-11-23 13:06:40,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {357#(= main_~i~0 0)} is VALID [2018-11-23 13:06:40,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {357#(= main_~i~0 0)} is VALID [2018-11-23 13:06:40,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {357#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:40,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:40,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {359#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:40,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !(~i~0 < 1024); {356#false} is VALID [2018-11-23 13:06:40,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {356#false} is VALID [2018-11-23 13:06:40,865 INFO L256 TraceCheckUtils]: 12: Hoare triple {356#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {356#false} is VALID [2018-11-23 13:06:40,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2018-11-23 13:06:40,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2018-11-23 13:06:40,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 13:06:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:40,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:40,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-23 13:06:40,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:40,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:40,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:40,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 13:06:41,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 13:06:41,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 13:06:41,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #35#return; {355#true} is VALID [2018-11-23 13:06:41,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret2 := main(); {355#true} is VALID [2018-11-23 13:06:41,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {378#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:41,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {378#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {378#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:41,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {378#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:41,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:41,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {359#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:41,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !(~i~0 < 1024); {356#false} is VALID [2018-11-23 13:06:41,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {356#false} is VALID [2018-11-23 13:06:41,148 INFO L256 TraceCheckUtils]: 12: Hoare triple {356#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {356#false} is VALID [2018-11-23 13:06:41,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2018-11-23 13:06:41,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2018-11-23 13:06:41,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 13:06:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:41,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:41,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:06:41,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:06:41,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:41,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:06:41,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:41,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:06:41,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:06:41,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:41,243 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-23 13:06:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:41,449 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:06:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:06:41,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:06:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 13:06:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 13:06:41,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2018-11-23 13:06:41,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:41,515 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:06:41,515 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:06:41,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:06:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 13:06:41,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:41,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2018-11-23 13:06:41,553 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2018-11-23 13:06:41,554 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2018-11-23 13:06:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:41,556 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:06:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:06:41,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:41,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:41,557 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2018-11-23 13:06:41,557 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2018-11-23 13:06:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:41,559 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:06:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:06:41,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:41,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:41,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:41,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:06:41,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-23 13:06:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:41,562 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:06:41,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:06:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:06:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:06:41,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:41,563 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:41,563 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:41,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2018-11-23 13:06:41,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:41,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:41,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:41,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:06:41,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:06:41,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:06:41,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #35#return; {515#true} is VALID [2018-11-23 13:06:41,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret2 := main(); {515#true} is VALID [2018-11-23 13:06:41,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {517#(= main_~i~0 0)} is VALID [2018-11-23 13:06:41,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {517#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {517#(= main_~i~0 0)} is VALID [2018-11-23 13:06:41,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:41,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:41,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:41,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:41,706 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:41,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 3)} assume !(~i~0 < 1024); {516#false} is VALID [2018-11-23 13:06:41,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {516#false} is VALID [2018-11-23 13:06:41,709 INFO L256 TraceCheckUtils]: 14: Hoare triple {516#false} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {516#false} is VALID [2018-11-23 13:06:41,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 13:06:41,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:06:41,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:06:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:41,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:41,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-23 13:06:41,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:41,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:06:41,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 13:06:41,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 13:06:41,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:41,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:41,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:41,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-23 13:06:42,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:06:42,120 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:06:42,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 13:06:42,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:42,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:42,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:42,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:7 [2018-11-23 13:06:42,147 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:06:42,147 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#A~0.base|, v_main_~i~0_10, |main_~#A~0.offset|]. (let ((.cse0 (select |#memory_int| |main_~#A~0.base|))) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select .cse0 (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))) (= (select .cse0 (+ |main_~#A~0.offset| 4092)) |main_#t~mem1|) (<= 1023 v_main_~i~0_10))) [2018-11-23 13:06:42,147 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 1023 |main_#t~mem1|) (< |main_#t~mem1| 1024)) [2018-11-23 13:06:42,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:06:42,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:06:42,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:06:42,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #35#return; {515#true} is VALID [2018-11-23 13:06:42,233 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret2 := main(); {515#true} is VALID [2018-11-23 13:06:42,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {515#true} is VALID [2018-11-23 13:06:42,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {515#true} is VALID [2018-11-23 13:06:42,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {515#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {515#true} is VALID [2018-11-23 13:06:42,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {515#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {515#true} is VALID [2018-11-23 13:06:42,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {515#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {515#true} is VALID [2018-11-23 13:06:42,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {515#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {554#(and (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))) (< main_~i~0 1024))} is VALID [2018-11-23 13:06:42,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {554#(and (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))) (< main_~i~0 1024))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {558#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|)))))} is VALID [2018-11-23 13:06:42,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {558#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|)))))} assume !(~i~0 < 1024); {562#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10)))} is VALID [2018-11-23 13:06:42,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {562#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10)))} call #t~mem1 := read~int(~#A~0.base, 4092 + ~#A~0.offset, 4); {566#(and (<= 1023 |main_#t~mem1|) (< |main_#t~mem1| 1024))} is VALID [2018-11-23 13:06:42,244 INFO L256 TraceCheckUtils]: 14: Hoare triple {566#(and (<= 1023 |main_#t~mem1|) (< |main_#t~mem1| 1024))} call __VERIFIER_assert((if 1023 == #t~mem1 then 1 else 0)); {570#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:06:42,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {570#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {574#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:06:42,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {574#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:06:42,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:06:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:06:42,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:06:42,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-11-23 13:06:42,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 13:06:42,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:42,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:06:42,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:42,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:06:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:06:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:06:42,312 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-11-23 13:06:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,165 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 13:06:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:06:47,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 13:06:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-11-23 13:06:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-11-23 13:06:47,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 27 transitions. [2018-11-23 13:06:47,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:47,213 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:06:47,213 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:06:47,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:06:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:06:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:06:47,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:47,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:47,215 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:47,215 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,215 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:06:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:06:47,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:47,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:47,216 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:47,216 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,216 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:06:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:06:47,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:47,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:47,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:47,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:06:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:06:47,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-23 13:06:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:47,218 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:06:47,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:06:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:06:47,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:47,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:06:47,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:06:47,325 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:06:47,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:06:47,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:06:47,325 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:06:47,325 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:06:47,326 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:06:47,326 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 15) the Hoare annotation is: true [2018-11-23 13:06:47,326 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 15) no Hoare annotation was computed. [2018-11-23 13:06:47,326 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (<= 1023 |main_#t~mem1|) (exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10))) (exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))))) (< |main_#t~mem1| 1024)) [2018-11-23 13:06:47,326 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-23 13:06:47,327 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 15) no Hoare annotation was computed. [2018-11-23 13:06:47,327 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2018-11-23 13:06:47,327 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (or (exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))))) (= main_~i~0 0)) [2018-11-23 13:06:47,327 INFO L448 ceAbstractionStarter]: For program point L11-4(lines 11 13) no Hoare annotation was computed. [2018-11-23 13:06:47,327 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 13:06:47,327 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 13:06:47,328 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 13:06:47,328 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 13:06:47,328 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 13:06:47,328 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 13:06:47,330 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:06:47,332 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:06:47,332 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:06:47,332 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:06:47,332 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-23 13:06:47,332 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-23 13:06:47,332 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:06:47,332 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:06:47,332 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-23 13:06:47,333 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:06:47,334 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-23 13:06:47,334 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:06:47,334 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:06:47,334 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:06:47,339 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,342 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:47,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,346 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:47,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:06:47 BoogieIcfgContainer [2018-11-23 13:06:47,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:06:47,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:06:47,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:06:47,349 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:06:47,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:38" (3/4) ... [2018-11-23 13:06:47,354 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:06:47,361 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:06:47,362 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:06:47,362 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:06:47,367 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 13:06:47,367 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:06:47,367 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:06:47,393 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_main_~i~0_10 : int :: (v_main_~i~0_10 < 1024 && i <= v_main_~i~0_10 + 1) && v_main_~i~0_10 == unknown-#memory_int-unknown[A][4 * v_main_~i~0_10 + A]) || i == 0 [2018-11-23 13:06:47,407 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/array_true-unreach-call1_true-termination.i-witness.graphml [2018-11-23 13:06:47,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:06:47,409 INFO L168 Benchmark]: Toolchain (without parser) took 10105.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -435.3 MB). Peak memory consumption was 302.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:47,411 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:06:47,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:47,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:06:47,413 INFO L168 Benchmark]: Boogie Preprocessor took 37.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:06:47,413 INFO L168 Benchmark]: RCFGBuilder took 558.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:47,414 INFO L168 Benchmark]: TraceAbstraction took 9067.55 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 339.9 MB). Peak memory consumption was 339.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:47,415 INFO L168 Benchmark]: Witness Printer took 58.88 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:06:47,419 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 349.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 558.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9067.55 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 339.9 MB). Peak memory consumption was 339.9 MB. Max. memory is 7.1 GB. * Witness Printer took 58.88 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2018-11-23 13:06:47,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,433 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:06:47,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-23 13:06:47,440 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (\exists v_main_~i~0_10 : int :: (v_main_~i~0_10 < 1024 && i <= v_main_~i~0_10 + 1) && v_main_~i~0_10 == unknown-#memory_int-unknown[A][4 * v_main_~i~0_10 + A]) || i == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 8.9s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 11 SDslu, 119 SDs, 0 SdLazy, 83 SolverSat, 11 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 77 HoareAnnotationTreeSize, 12 FomulaSimplifications, 75 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 120 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 2 QuantifiedInterpolants, 3378 SizeOfPredicates, 8 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 9/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...