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_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/poly2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:28:58,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:28:58,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:28:58,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:28:58,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:28:58,253 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:28:58,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:28:58,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:28:58,258 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:28:58,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:28:58,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:28:58,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:28:58,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:28:58,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:28:58,266 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:28:58,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:28:58,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:28:58,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:28:58,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:28:58,281 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:28:58,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:28:58,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:28:58,292 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:28:58,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:28:58,293 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:28:58,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:28:58,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:28:58,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:28:58,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:28:58,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:28:58,302 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:28:58,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:28:58,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:28:58,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:28:58,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:28:58,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:28:58,306 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:28:58,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:28:58,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:28:58,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:28:58,338 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:28:58,338 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:28:58,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:28:58,339 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:28:58,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:28:58,339 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:28:58,339 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:28:58,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:28:58,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:28:58,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:28:58,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:28:58,341 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:28:58,341 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:28:58,342 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:28:58,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:28:58,342 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:28:58,342 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:28:58,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:28:58,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:28:58,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:28:58,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:28:58,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:28:58,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:28:58,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:28:58,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:28:58,345 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:28:58,346 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:28:58,346 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:28:58,346 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:28:58,346 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:28:58,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:28:58,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:28:58,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:28:58,422 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:28:58,423 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:28:58,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/poly2_true-unreach-call.i [2018-11-23 10:28:58,486 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c39859c1/5ff386a4832940ccb4f3c95c50438104/FLAG02dbcb93d [2018-11-23 10:28:58,919 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:28:58,920 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly2_true-unreach-call.i [2018-11-23 10:28:58,925 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c39859c1/5ff386a4832940ccb4f3c95c50438104/FLAG02dbcb93d [2018-11-23 10:28:59,317 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c39859c1/5ff386a4832940ccb4f3c95c50438104 [2018-11-23 10:28:59,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:28:59,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:28:59,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:28:59,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:28:59,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:28:59,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db51b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59, skipping insertion in model container [2018-11-23 10:28:59,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:28:59,381 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:28:59,643 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:28:59,649 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:28:59,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:28:59,706 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:28:59,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59 WrapperNode [2018-11-23 10:28:59,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:28:59,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:28:59,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:28:59,709 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:28:59,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:28:59,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:28:59,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:28:59,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:28:59,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (1/1) ... [2018-11-23 10:28:59,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:28:59,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:28:59,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:28:59,853 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:28:59,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (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 10:28:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-23 10:28:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:28:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:28:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:28:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:28:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:28:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:28:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:28:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-23 10:28:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:28:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:28:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:29:00,534 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:29:00,534 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:29:00,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:00 BoogieIcfgContainer [2018-11-23 10:29:00,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:29:00,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:29:00,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:29:00,540 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:29:00,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:28:59" (1/3) ... [2018-11-23 10:29:00,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bea05db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:00, skipping insertion in model container [2018-11-23 10:29:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:59" (2/3) ... [2018-11-23 10:29:00,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bea05db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:00, skipping insertion in model container [2018-11-23 10:29:00,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:00" (3/3) ... [2018-11-23 10:29:00,544 INFO L112 eAbstractionObserver]: Analyzing ICFG poly2_true-unreach-call.i [2018-11-23 10:29:00,554 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:29:00,563 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:29:00,583 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:29:00,615 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:29:00,616 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:29:00,616 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:29:00,616 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:29:00,617 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:29:00,617 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:29:00,617 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:29:00,617 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:29:00,617 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:29:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 10:29:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:29:00,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:00,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:00,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:00,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1393092878, now seen corresponding path program 1 times [2018-11-23 10:29:00,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:00,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:00,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:00,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:01,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 10:29:01,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {32#true} is VALID [2018-11-23 10:29:01,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 10:29:01,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #70#return; {32#true} is VALID [2018-11-23 10:29:01,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-23 10:29:01,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {32#true} is VALID [2018-11-23 10:29:01,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {32#true} is VALID [2018-11-23 10:29:01,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 10:29:01,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {33#false} is VALID [2018-11-23 10:29:01,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume !true; {33#false} is VALID [2018-11-23 10:29:01,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {33#false} is VALID [2018-11-23 10:29:01,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem6 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {33#false} is VALID [2018-11-23 10:29:01,079 INFO L256 TraceCheckUtils]: 12: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem6 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-23 10:29:01,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 10:29:01,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume 0bv32 == ~cond; {33#false} is VALID [2018-11-23 10:29:01,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 10:29:01,085 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 10:29:01,086 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:29:01,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:01,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:29:01,098 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 10:29:01,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:01,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:29:01,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:01,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:29:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:29:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:29:01,260 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 10:29:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:01,579 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-11-23 10:29:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:29:01,580 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 10:29:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2018-11-23 10:29:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:29:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2018-11-23 10:29:01,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2018-11-23 10:29:01,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:01,997 INFO L225 Difference]: With dead ends: 48 [2018-11-23 10:29:01,997 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 10:29:02,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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 10:29:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 10:29:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 10:29:02,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:02,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:02,053 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:02,053 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:02,057 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:29:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:29:02,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:02,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:02,059 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:02,059 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:29:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:02,064 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:29:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:29:02,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:02,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:02,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:02,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:29:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 10:29:02,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2018-11-23 10:29:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:02,071 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 10:29:02,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:29:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:29:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:29:02,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:02,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:02,073 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:02,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash -168355482, now seen corresponding path program 1 times [2018-11-23 10:29:02,074 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:02,074 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:02,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:02,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:02,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2018-11-23 10:29:02,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {217#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {217#true} is VALID [2018-11-23 10:29:02,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {217#true} assume true; {217#true} is VALID [2018-11-23 10:29:02,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {217#true} {217#true} #70#return; {217#true} is VALID [2018-11-23 10:29:02,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {217#true} call #t~ret7 := main(); {217#true} is VALID [2018-11-23 10:29:02,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {217#true} is VALID [2018-11-23 10:29:02,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {240#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:02,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {240#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {218#false} is VALID [2018-11-23 10:29:02,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {218#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {218#false} is VALID [2018-11-23 10:29:02,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {218#false} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {218#false} is VALID [2018-11-23 10:29:02,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {218#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {218#false} is VALID [2018-11-23 10:29:02,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {218#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem6 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {218#false} is VALID [2018-11-23 10:29:02,349 INFO L256 TraceCheckUtils]: 12: Hoare triple {218#false} call __VERIFIER_assert((if #t~mem6 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {218#false} is VALID [2018-11-23 10:29:02,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2018-11-23 10:29:02,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {218#false} assume 0bv32 == ~cond; {218#false} is VALID [2018-11-23 10:29:02,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {218#false} assume !false; {218#false} is VALID [2018-11-23 10:29:02,351 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 10:29:02,352 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:29:02,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:02,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:29:02,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:29:02,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:02,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:29:02,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:02,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:29:02,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:29:02,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:29:02,436 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 3 states. [2018-11-23 10:29:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:03,475 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 10:29:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:29:03,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:29:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:29:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-23 10:29:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:29:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-23 10:29:03,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2018-11-23 10:29:03,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:03,867 INFO L225 Difference]: With dead ends: 37 [2018-11-23 10:29:03,867 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 10:29:03,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 10:29:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 10:29:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 10:29:03,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:03,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 10:29:03,881 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 10:29:03,881 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 10:29:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:03,885 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 10:29:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 10:29:03,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:03,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:03,886 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 10:29:03,886 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 10:29:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:03,888 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 10:29:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 10:29:03,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:03,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:03,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:03,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 10:29:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 10:29:03,892 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2018-11-23 10:29:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:03,893 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 10:29:03,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:29:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 10:29:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:29:03,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:03,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:03,894 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:03,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:03,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1424265188, now seen corresponding path program 1 times [2018-11-23 10:29:03,895 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:03,896 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:03,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:29:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:04,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:04,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 10:29:04,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {399#true} is VALID [2018-11-23 10:29:04,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 10:29:04,189 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #70#return; {399#true} is VALID [2018-11-23 10:29:04,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret7 := main(); {399#true} is VALID [2018-11-23 10:29:04,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {399#true} is VALID [2018-11-23 10:29:04,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {399#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {422#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:04,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {422#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvadd64(~bvmul64(~i~0, ~i~0), ~sign_extendFrom32To64(2bv32)), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {422#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:04,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {422#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {429#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-23 10:29:04,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {400#false} is VALID [2018-11-23 10:29:04,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {400#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {400#false} is VALID [2018-11-23 10:29:04,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {400#false} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {400#false} is VALID [2018-11-23 10:29:04,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {400#false} is VALID [2018-11-23 10:29:04,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem6 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {400#false} is VALID [2018-11-23 10:29:04,200 INFO L256 TraceCheckUtils]: 14: Hoare triple {400#false} call __VERIFIER_assert((if #t~mem6 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {400#false} is VALID [2018-11-23 10:29:04,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} ~cond := #in~cond; {400#false} is VALID [2018-11-23 10:29:04,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#false} assume 0bv32 == ~cond; {400#false} is VALID [2018-11-23 10:29:04,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 10:29:04,202 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 10:29:04,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:29:04,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 10:29:04,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#false} assume 0bv32 == ~cond; {400#false} is VALID [2018-11-23 10:29:04,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} ~cond := #in~cond; {400#false} is VALID [2018-11-23 10:29:04,303 INFO L256 TraceCheckUtils]: 14: Hoare triple {400#false} call __VERIFIER_assert((if #t~mem6 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {400#false} is VALID [2018-11-23 10:29:04,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem6 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {400#false} is VALID [2018-11-23 10:29:04,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {400#false} is VALID [2018-11-23 10:29:04,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {400#false} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {400#false} is VALID [2018-11-23 10:29:04,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {400#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {400#false} is VALID [2018-11-23 10:29:04,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {481#(bvslt main_~i~0 ((_ sign_extend 32) ~SIZE~0))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {400#false} is VALID [2018-11-23 10:29:04,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {485#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {481#(bvslt main_~i~0 ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-23 10:29:04,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {485#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvadd64(~bvmul64(~i~0, ~i~0), ~sign_extendFrom32To64(2bv32)), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {485#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-23 10:29:04,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {399#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {485#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-23 10:29:04,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {399#true} is VALID [2018-11-23 10:29:04,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret7 := main(); {399#true} is VALID [2018-11-23 10:29:04,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #70#return; {399#true} is VALID [2018-11-23 10:29:04,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 10:29:04,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {399#true} is VALID [2018-11-23 10:29:04,335 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 10:29:04,336 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 10:29:04,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:29:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:29:04,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 10:29:04,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:04,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:29:04,531 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 10:29:04,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:29:04,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:29:04,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:29:04,532 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-23 10:29:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:05,769 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 10:29:05,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 10:29:05,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 10:29:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:29:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 10:29:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:29:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 10:29:05,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2018-11-23 10:29:06,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:06,059 INFO L225 Difference]: With dead ends: 39 [2018-11-23 10:29:06,059 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:29:06,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:29:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:29:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 10:29:06,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:06,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 10:29:06,075 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 10:29:06,075 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 10:29:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:06,077 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 10:29:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 10:29:06,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:06,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:06,079 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 10:29:06,079 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 10:29:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:06,081 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 10:29:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 10:29:06,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:06,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:06,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:06,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:29:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 10:29:06,085 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2018-11-23 10:29:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:06,085 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 10:29:06,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:29:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 10:29:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:29:06,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:29:06,087 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:29:06,087 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:29:06,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:29:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1370595614, now seen corresponding path program 2 times [2018-11-23 10:29:06,088 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:29:06,088 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:29:06,107 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:29:06,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:29:06,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:29:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:29:06,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:29:06,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {654#true} call ULTIMATE.init(); {654#true} is VALID [2018-11-23 10:29:06,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {654#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {654#true} is VALID [2018-11-23 10:29:06,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-23 10:29:06,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {654#true} {654#true} #70#return; {654#true} is VALID [2018-11-23 10:29:06,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {654#true} call #t~ret7 := main(); {654#true} is VALID [2018-11-23 10:29:06,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {654#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {654#true} is VALID [2018-11-23 10:29:06,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {654#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {677#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:06,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {677#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvadd64(~bvmul64(~i~0, ~i~0), ~sign_extendFrom32To64(2bv32)), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {677#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:06,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {677#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {677#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:06,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {677#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvadd64(~bvmul64(~i~0, ~i~0), ~sign_extendFrom32To64(2bv32)), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {677#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:06,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {677#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:06,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {677#(bvsgt ~SIZE~0 (_ bv1 32))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {677#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:29:06,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#(bvsgt ~SIZE~0 (_ bv1 32))} ~i~0 := ~sign_extendFrom32To64(0bv32); {696#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:29:06,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {655#false} is VALID [2018-11-23 10:29:06,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {655#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {655#false} is VALID [2018-11-23 10:29:06,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {655#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem6 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {655#false} is VALID [2018-11-23 10:29:06,363 INFO L256 TraceCheckUtils]: 16: Hoare triple {655#false} call __VERIFIER_assert((if #t~mem6 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {655#false} is VALID [2018-11-23 10:29:06,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {655#false} ~cond := #in~cond; {655#false} is VALID [2018-11-23 10:29:06,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {655#false} assume 0bv32 == ~cond; {655#false} is VALID [2018-11-23 10:29:06,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {655#false} assume !false; {655#false} is VALID [2018-11-23 10:29:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:29:06,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:29:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:29:06,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:29:06,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 10:29:06,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:29:06,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:29:06,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:06,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:29:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:29:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:29:06,506 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 4 states. [2018-11-23 10:29:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:06,778 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 10:29:06,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:29:06,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 10:29:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:29:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:29:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 10:29:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:29:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 10:29:06,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2018-11-23 10:29:06,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:29:06,942 INFO L225 Difference]: With dead ends: 25 [2018-11-23 10:29:06,942 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:29:06,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:29:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:29:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:29:06,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:29:06,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:29:06,944 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:29:06,944 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:29:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:06,944 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:29:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:29:06,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:06,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:06,945 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:29:06,945 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:29:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:29:06,946 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:29:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:29:06,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:06,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:29:06,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:29:06,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:29:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:29:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:29:06,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-23 10:29:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:29:06,948 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:29:06,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:29:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:29:06,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:29:06,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:29:07,351 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:29:07,351 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:29:07,351 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:29:07,351 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:29:07,352 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:29:07,352 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:29:07,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:29:07,352 INFO L444 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: false [2018-11-23 10:29:07,352 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2018-11-23 10:29:07,353 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 29 32) no Hoare annotation was computed. [2018-11-23 10:29:07,353 INFO L444 ceAbstractionStarter]: At program point L29-3(lines 29 32) the Hoare annotation is: false [2018-11-23 10:29:07,353 INFO L448 ceAbstractionStarter]: For program point L29-4(lines 29 32) no Hoare annotation was computed. [2018-11-23 10:29:07,353 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 35) no Hoare annotation was computed. [2018-11-23 10:29:07,353 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2018-11-23 10:29:07,353 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 23 26) the Hoare annotation is: (and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32))) [2018-11-23 10:29:07,354 INFO L448 ceAbstractionStarter]: For program point L23-4(lines 23 26) no Hoare annotation was computed. [2018-11-23 10:29:07,354 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 33) no Hoare annotation was computed. [2018-11-23 10:29:07,354 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 35) no Hoare annotation was computed. [2018-11-23 10:29:07,354 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 33) no Hoare annotation was computed. [2018-11-23 10:29:07,354 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 35) the Hoare annotation is: true [2018-11-23 10:29:07,354 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2018-11-23 10:29:07,355 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 21) the Hoare annotation is: (bvsgt ~SIZE~0 (_ bv1 32)) [2018-11-23 10:29:07,355 INFO L448 ceAbstractionStarter]: For program point L18-4(lines 18 21) no Hoare annotation was computed. [2018-11-23 10:29:07,355 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 5) the Hoare annotation is: true [2018-11-23 10:29:07,355 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 5) no Hoare annotation was computed. [2018-11-23 10:29:07,355 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 10:29:07,355 INFO L448 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2018-11-23 10:29:07,355 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 10:29:07,356 INFO L448 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2018-11-23 10:29:07,357 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 10:29:07,357 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 10:29:07,358 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 10:29:07,358 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 10:29:07,358 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:29:07,358 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 10:29:07,358 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 10:29:07,358 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 10:29:07,358 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 10:29:07,358 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2018-11-23 10:29:07,359 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 10:29:07,360 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-23 10:29:07,361 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2018-11-23 10:29:07,361 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-23 10:29:07,361 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-23 10:29:07,361 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-23 10:29:07,361 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-23 10:29:07,361 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 10:29:07,369 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsgt32 [2018-11-23 10:29:07,370 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsgt32 [2018-11-23 10:29:07,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:29:07 BoogieIcfgContainer [2018-11-23 10:29:07,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:29:07,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:29:07,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:29:07,373 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:29:07,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:00" (3/4) ... [2018-11-23 10:29:07,377 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:29:07,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:29:07,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:29:07,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 10:29:07,388 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 10:29:07,389 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 10:29:07,389 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:29:07,440 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-tiling/poly2_true-unreach-call.i-witness.graphml [2018-11-23 10:29:07,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:29:07,442 INFO L168 Benchmark]: Toolchain (without parser) took 8111.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -513.0 MB). Peak memory consumption was 212.7 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:07,443 INFO L168 Benchmark]: CDTParser took 0.53 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 10:29:07,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.86 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:07,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.50 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 10:29:07,445 INFO L168 Benchmark]: Boogie Preprocessor took 113.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:07,446 INFO L168 Benchmark]: RCFGBuilder took 682.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:07,446 INFO L168 Benchmark]: TraceAbstraction took 6835.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 219.0 MB). Peak memory consumption was 219.0 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:07,447 INFO L168 Benchmark]: Witness Printer took 68.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 10:29:07,451 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.53 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 374.86 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.50 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 113.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 682.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6835.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 219.0 MB). Peak memory consumption was 219.0 MB. Max. memory is 7.1 GB. * Witness Printer took 68.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsgt32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsgt32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 23]: Loop Invariant Derived loop invariant: i == ~sign_extendFrom32To64(0bv32) && ~bvsgt32(SIZE, 1bv32) - InvariantResult [Line: 18]: Loop Invariant [2018-11-23 10:29:07,460 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsgt32 [2018-11-23 10:29:07,460 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsgt32 Derived loop invariant: NULL - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 79 SDtfs, 7 SDslu, 36 SDs, 0 SdLazy, 51 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 15 NumberOfFragments, 18 HoareAnnotationTreeSize, 12 FomulaSimplifications, 19 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 70 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 2467 SizeOfPredicates, 7 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...