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/loops/nec20_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:23:25,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:23:25,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:23:25,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:23:25,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:23:25,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:23:25,339 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:23:25,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:23:25,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:23:25,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:23:25,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:23:25,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:23:25,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:23:25,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:23:25,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:23:25,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:23:25,357 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:23:25,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:23:25,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:23:25,363 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:23:25,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:23:25,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:23:25,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:23:25,368 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:23:25,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:23:25,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:23:25,370 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:23:25,371 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:23:25,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:23:25,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:23:25,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:23:25,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:23:25,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:23:25,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:23:25,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:23:25,376 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:23:25,376 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 11:23:25,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:23:25,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:23:25,400 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:23:25,400 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:23:25,401 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:23:25,401 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:23:25,401 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:23:25,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:23:25,402 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:23:25,402 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:23:25,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:23:25,402 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:23:25,403 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:23:25,403 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:23:25,403 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:23:25,403 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:23:25,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:23:25,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:23:25,405 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:23:25,405 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:23:25,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:23:25,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:23:25,406 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:23:25,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:23:25,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:23:25,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:23:25,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:23:25,407 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:23:25,407 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:23:25,407 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:23:25,407 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:23:25,407 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:23:25,408 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:23:25,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:23:25,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:23:25,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:23:25,491 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:23:25,492 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:23:25,492 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec20_false-unreach-call_true-termination.i [2018-11-23 11:23:25,550 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/287f6ff24/b0a48bf20bfe4dbe8edc389ee0f52aba/FLAG36a7019bd [2018-11-23 11:23:25,999 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:23:25,999 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec20_false-unreach-call_true-termination.i [2018-11-23 11:23:26,007 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/287f6ff24/b0a48bf20bfe4dbe8edc389ee0f52aba/FLAG36a7019bd [2018-11-23 11:23:26,355 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/287f6ff24/b0a48bf20bfe4dbe8edc389ee0f52aba [2018-11-23 11:23:26,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:23:26,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:23:26,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:26,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:23:26,373 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:23:26,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2193ab3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26, skipping insertion in model container [2018-11-23 11:23:26,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:23:26,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:23:26,660 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:26,668 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:23:26,697 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:26,722 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:23:26,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26 WrapperNode [2018-11-23 11:23:26,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:26,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:26,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:23:26,724 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:23:26,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:26,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:23:26,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:23:26,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:23:26,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (1/1) ... [2018-11-23 11:23:26,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:23:26,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:23:26,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:23:26,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:23:26,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (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 11:23:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:23:26,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:23:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:23:26,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:23:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:23:26,987 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:23:26,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:23:26,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:23:27,510 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:23:27,511 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:23:27,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:27 BoogieIcfgContainer [2018-11-23 11:23:27,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:23:27,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:23:27,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:23:27,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:23:27,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:23:26" (1/3) ... [2018-11-23 11:23:27,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca2e344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:27, skipping insertion in model container [2018-11-23 11:23:27,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:26" (2/3) ... [2018-11-23 11:23:27,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca2e344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:27, skipping insertion in model container [2018-11-23 11:23:27,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:27" (3/3) ... [2018-11-23 11:23:27,520 INFO L112 eAbstractionObserver]: Analyzing ICFG nec20_false-unreach-call_true-termination.i [2018-11-23 11:23:27,529 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:23:27,537 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:23:27,555 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:23:27,589 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:23:27,590 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:23:27,590 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:23:27,591 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:23:27,591 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:23:27,591 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:23:27,592 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:23:27,592 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:23:27,592 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:23:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:23:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:23:27,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:27,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:27,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:27,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash -676339564, now seen corresponding path program 1 times [2018-11-23 11:23:27,631 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:27,631 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 11:23:27,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:27,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:27,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:23:27,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} ~b~0 := 0bv32; {28#true} is VALID [2018-11-23 11:23:27,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:23:27,951 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #52#return; {28#true} is VALID [2018-11-23 11:23:27,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret3 := main(); {28#true} is VALID [2018-11-23 11:23:27,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} ~k~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; {28#true} is VALID [2018-11-23 11:23:27,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume 0bv8 != ~k~0;~n~0 := 0bv32; {51#(= main_~n~0 (_ bv0 32))} is VALID [2018-11-23 11:23:27,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {51#(= main_~n~0 (_ bv0 32))} ~i~0 := 0bv32;~j~0 := #t~nondet1;havoc #t~nondet1; {55#(and (= main_~n~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:23:27,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#(and (= main_~n~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvsgt32(~j~0, 10000bv32); {55#(and (= main_~n~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:23:27,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#(and (= main_~n~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~n~0); {29#false} is VALID [2018-11-23 11:23:27,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~a~0 := ~a~0[~i~0 := 0bv32];~a~0 := ~a~0[~j~0 := 0bv32]; {29#false} is VALID [2018-11-23 11:23:27,956 INFO L256 TraceCheckUtils]: 11: Hoare triple {29#false} call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 11:23:27,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 11:23:27,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 11:23:27,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:23:27,960 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 11:23:27,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:27,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:27,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:23:27,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:23:27,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:27,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:23:28,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:28,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:23:28,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:23:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:23:28,221 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2018-11-23 11:23:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:28,709 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2018-11-23 11:23:28,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:23:28,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:23:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:23:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:23:28,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-23 11:23:28,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:28,984 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:23:28,984 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:23:28,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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 11:23:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:23:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-11-23 11:23:29,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:29,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 19 states. [2018-11-23 11:23:29,037 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 19 states. [2018-11-23 11:23:29,037 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 19 states. [2018-11-23 11:23:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:29,042 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:23:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:23:29,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:29,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:29,043 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 22 states. [2018-11-23 11:23:29,043 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 22 states. [2018-11-23 11:23:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:29,047 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:23:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:23:29,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:29,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:29,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:29,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:23:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 11:23:29,053 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-23 11:23:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:29,054 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 11:23:29,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:23:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:23:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:23:29,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:29,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:29,056 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:29,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash 3718806, now seen corresponding path program 1 times [2018-11-23 11:23:29,057 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:29,057 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 11:23:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:29,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:29,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 11:23:29,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} ~b~0 := 0bv32; {212#true} is VALID [2018-11-23 11:23:29,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 11:23:29,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #52#return; {212#true} is VALID [2018-11-23 11:23:29,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret3 := main(); {212#true} is VALID [2018-11-23 11:23:29,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} ~k~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; {212#true} is VALID [2018-11-23 11:23:29,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {212#true} assume !(0bv8 != ~k~0);~n~0 := 1023bv32; {235#(= (_ bv1023 32) main_~n~0)} is VALID [2018-11-23 11:23:29,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {235#(= (_ bv1023 32) main_~n~0)} ~i~0 := 0bv32;~j~0 := #t~nondet1;havoc #t~nondet1; {239#(and (= main_~i~0 (_ bv0 32)) (= (_ bv1023 32) main_~n~0))} is VALID [2018-11-23 11:23:29,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {239#(and (= main_~i~0 (_ bv0 32)) (= (_ bv1023 32) main_~n~0))} assume !~bvsgt32(~j~0, 10000bv32); {239#(and (= main_~i~0 (_ bv0 32)) (= (_ bv1023 32) main_~n~0))} is VALID [2018-11-23 11:23:29,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {239#(and (= main_~i~0 (_ bv0 32)) (= (_ bv1023 32) main_~n~0))} assume !~bvsle32(~i~0, ~n~0); {213#false} is VALID [2018-11-23 11:23:29,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {213#false} ~a~0 := ~a~0[~i~0 := 0bv32];~a~0 := ~a~0[~j~0 := 0bv32]; {213#false} is VALID [2018-11-23 11:23:29,507 INFO L256 TraceCheckUtils]: 11: Hoare triple {213#false} call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); {213#false} is VALID [2018-11-23 11:23:29,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 11:23:29,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume 0bv32 == ~cond; {213#false} is VALID [2018-11-23 11:23:29,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 11:23:29,509 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 11:23:29,509 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:29,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:29,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:23:29,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:23:29,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:29,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:23:29,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:29,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:23:29,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:23:29,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:23:29,600 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2018-11-23 11:23:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:29,750 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:23:29,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:23:29,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:23:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-23 11:23:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-23 11:23:29,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-23 11:23:29,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:29,807 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:23:29,807 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:23:29,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:23:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:23:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-11-23 11:23:29,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:29,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 17 states. [2018-11-23 11:23:29,889 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 17 states. [2018-11-23 11:23:29,889 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 17 states. [2018-11-23 11:23:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:29,892 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 11:23:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:23:29,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:29,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:29,893 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 23 states. [2018-11-23 11:23:29,893 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 23 states. [2018-11-23 11:23:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:29,896 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 11:23:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:23:29,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:29,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:29,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:29,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:23:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:23:29,899 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-11-23 11:23:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:29,900 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:23:29,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:23:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:23:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:23:29,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:29,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:29,901 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:29,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2087974871, now seen corresponding path program 1 times [2018-11-23 11:23:29,902 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:29,902 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 11:23:29,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:23:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:23:30,017 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-23 11:23:30,018 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~b~0)|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] ~b~0 := 0bv32; VAL [|old(~b~0)|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume true; VAL [|old(~b~0)|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] RET #52#return; VAL [~b~0=(_ bv0 32)] [?] CALL call #t~ret3 := main(); VAL [~b~0=(_ bv0 32)] [?] ~k~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; VAL [main_~k~0=(_ bv32 8), ~b~0=(_ bv0 32)] [?] assume 0bv8 != ~k~0;~n~0 := 0bv32; VAL [main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] ~i~0 := 0bv32;~j~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~i~0=(_ bv0 32), main_~j~0=(_ bv8191 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume !~bvsgt32(~j~0, 10000bv32); VAL [main_~i~0=(_ bv0 32), main_~j~0=(_ bv8191 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume !!~bvsle32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~j~0 := ~bvadd32(2bv32, ~j~0); VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv8193 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume !~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv8193 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] ~a~0 := ~a~0[~i~0 := 0bv32];~a~0 := ~a~0[~j~0 := 0bv32]; VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv8193 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] ensures true; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] assume 0bv8 != ~k~0; [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25-L26] assume !~bvsgt32(~j~0, 10000bv32); VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] assume !!~bvsle32(~i~0, ~n~0); [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] assume !~bvsle32(~i~0, ~n~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0 := ~a~0[~i~0 := 0bv32]; [L34] ~a~0 := ~a~0[~j~0 := 0bv32]; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] ensures true; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] assume 0bv8 != ~k~0; [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25-L26] assume !~bvsgt32(~j~0, 10000bv32); VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] assume !!~bvsle32(~i~0, ~n~0); [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] assume !~bvsle32(~i~0, ~n~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0 := ~a~0[~i~0 := 0bv32]; [L34] ~a~0 := ~a~0[~j~0 := 0bv32]; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] COND TRUE 0bv8 != ~k~0 [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25] COND FALSE !(~bvsgt32(~j~0, 10000bv32)) VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0[~i~0] := 0bv32; [L34] ~a~0[~j~0] := 0bv32; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] COND TRUE 0bv8 != ~k~0 [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25] COND FALSE !(~bvsgt32(~j~0, 10000bv32)) VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0[~i~0] := 0bv32; [L34] ~a~0[~j~0] := 0bv32; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] COND TRUE 0bv8 != ~k~0 [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25] COND FALSE !(~bvsgt32(~j~0, 10000bv32)) VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0[~i~0] := 0bv32; [L34] ~a~0[~j~0] := 0bv32; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] COND TRUE 0bv8 != ~k~0 [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25] COND FALSE !(~bvsgt32(~j~0, 10000bv32)) VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0[~i~0] := 0bv32; [L34] ~a~0[~j~0] := 0bv32; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L10] int b; VAL [\old(b)=0, b=0] [L13] _Bool k=__VERIFIER_nondet_bool(); [L14] int i,n,j; [L15] int a[1025]; VAL [b=0, k=32] [L17] COND TRUE \read(k) [L18] n=0 VAL [b=0, k=32, n=0] [L23] i=0 [L24] j=__VERIFIER_nondet_int() [L25] COND FALSE !(j > 10000) VAL [b=0, i=0, j=8191, k=32, n=0] [L28] COND TRUE i <= n [L29] i++ [L30] j= j +2 VAL [b=0, i=1, j=8193, k=32, n=0] [L28] COND FALSE !(i <= n) VAL [b=0, i=1, j=8193, k=32, n=0] [L33] a[i]=0 [L34] a[j]=0 VAL [b=0, i=1, j=8193, k=32, n=0] [L35] CALL __VERIFIER_assert(j<1025) VAL [\old(cond)=0, b=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, b=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, b=0, cond=0] ----- [2018-11-23 11:23:30,077 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:23:30,077 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:23:30,077 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:23:30,078 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:23:30,078 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 11:23:30,078 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:23:30,078 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:23:30,078 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:23:30,078 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:23:30,079 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:23:30,079 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:23:30,079 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:23:30,079 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:23:30,079 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:23:30,079 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 11:23:30,079 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 11:23:30,080 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 11:23:30,080 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 11:23:30,080 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 11:23:30,080 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 11:23:30,080 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:23:30,080 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:23:30,081 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-23 11:23:30,081 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-23 11:23:30,081 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-23 11:23:30,081 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 11:23:30,081 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:23:30,081 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2018-11-23 11:23:30,082 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 11:23:30,082 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 11:23:30,082 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 11:23:30,082 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 11:23:30,082 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2018-11-23 11:23:30,083 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:23:30,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:23:30 BoogieIcfgContainer [2018-11-23 11:23:30,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:23:30,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:23:30,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:23:30,086 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:23:30,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:27" (3/4) ... [2018-11-23 11:23:30,090 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~b~0)|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] ~b~0 := 0bv32; VAL [|old(~b~0)|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume true; VAL [|old(~b~0)|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] RET #52#return; VAL [~b~0=(_ bv0 32)] [?] CALL call #t~ret3 := main(); VAL [~b~0=(_ bv0 32)] [?] ~k~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; VAL [main_~k~0=(_ bv32 8), ~b~0=(_ bv0 32)] [?] assume 0bv8 != ~k~0;~n~0 := 0bv32; VAL [main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] ~i~0 := 0bv32;~j~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~i~0=(_ bv0 32), main_~j~0=(_ bv8191 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume !~bvsgt32(~j~0, 10000bv32); VAL [main_~i~0=(_ bv0 32), main_~j~0=(_ bv8191 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume !!~bvsle32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~j~0 := ~bvadd32(2bv32, ~j~0); VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv8193 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume !~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv8193 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] ~a~0 := ~a~0[~i~0 := 0bv32];~a~0 := ~a~0[~j~0 := 0bv32]; VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv8193 32), main_~k~0=(_ bv32 8), main_~n~0=(_ bv0 32), ~b~0=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), ~b~0=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] ensures true; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] assume 0bv8 != ~k~0; [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25-L26] assume !~bvsgt32(~j~0, 10000bv32); VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] assume !!~bvsle32(~i~0, ~n~0); [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] assume !~bvsle32(~i~0, ~n~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0 := ~a~0[~i~0 := 0bv32]; [L34] ~a~0 := ~a~0[~j~0 := 0bv32]; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] ensures true; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] assume 0bv8 != ~k~0; [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25-L26] assume !~bvsgt32(~j~0, 10000bv32); VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] assume !!~bvsle32(~i~0, ~n~0); [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] assume !~bvsle32(~i~0, ~n~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0 := ~a~0[~i~0 := 0bv32]; [L34] ~a~0 := ~a~0[~j~0 := 0bv32]; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] COND TRUE 0bv8 != ~k~0 [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25] COND FALSE !(~bvsgt32(~j~0, 10000bv32)) VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0[~i~0] := 0bv32; [L34] ~a~0[~j~0] := 0bv32; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] COND TRUE 0bv8 != ~k~0 [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25] COND FALSE !(~bvsgt32(~j~0, 10000bv32)) VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0[~i~0] := 0bv32; [L34] ~a~0[~j~0] := 0bv32; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] COND TRUE 0bv8 != ~k~0 [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25] COND FALSE !(~bvsgt32(~j~0, 10000bv32)) VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0[~i~0] := 0bv32; [L34] ~a~0[~j~0] := 0bv32; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=0bv32, ~b~0=0bv32] [L10] ~b~0 := 0bv32; VAL [old(~b~0)=0bv32, ~b~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~b~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [~b~0=0bv32] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0bv32, ~k~0=32bv8] [L17-L21] COND TRUE 0bv8 != ~k~0 [L18] ~n~0 := 0bv32; VAL [~b~0=0bv32, ~k~0=32bv8, ~n~0=0bv32] [L23] ~i~0 := 0bv32; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L25] COND FALSE !(~bvsgt32(~j~0, 10000bv32)) VAL [~b~0=0bv32, ~i~0=0bv32, ~j~0=8191bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := ~bvadd32(1bv32, #t~post2); [L29] havoc #t~post2; [L30] ~j~0 := ~bvadd32(2bv32, ~j~0); VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L28-L31] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L33] ~a~0[~i~0] := 0bv32; [L34] ~a~0[~j~0] := 0bv32; VAL [~b~0=0bv32, ~i~0=1bv32, ~j~0=8193bv32, ~k~0=32bv8, ~n~0=0bv32] [L35] CALL call __VERIFIER_assert((if ~bvslt32(~j~0, 1025bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, ~b~0=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, ~b~0=0bv32, ~cond=0bv32] [L10] int b; VAL [\old(b)=0, b=0] [L13] _Bool k=__VERIFIER_nondet_bool(); [L14] int i,n,j; [L15] int a[1025]; VAL [b=0, k=32] [L17] COND TRUE \read(k) [L18] n=0 VAL [b=0, k=32, n=0] [L23] i=0 [L24] j=__VERIFIER_nondet_int() [L25] COND FALSE !(j > 10000) VAL [b=0, i=0, j=8191, k=32, n=0] [L28] COND TRUE i <= n [L29] i++ [L30] j= j +2 VAL [b=0, i=1, j=8193, k=32, n=0] [L28] COND FALSE !(i <= n) VAL [b=0, i=1, j=8193, k=32, n=0] [L33] a[i]=0 [L34] a[j]=0 VAL [b=0, i=1, j=8193, k=32, n=0] [L35] CALL __VERIFIER_assert(j<1025) VAL [\old(cond)=0, b=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, b=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, b=0, cond=0] ----- [2018-11-23 11:23:30,195 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/nec20_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:23:30,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:23:30,197 INFO L168 Benchmark]: Toolchain (without parser) took 3830.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -674.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:30,199 INFO L168 Benchmark]: CDTParser took 0.19 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 11:23:30,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.75 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: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:30,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.49 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 11:23:30,201 INFO L168 Benchmark]: Boogie Preprocessor took 45.91 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 11:23:30,203 INFO L168 Benchmark]: RCFGBuilder took 710.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:30,204 INFO L168 Benchmark]: TraceAbstraction took 2573.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 137.3 MB). Peak memory consumption was 137.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:30,205 INFO L168 Benchmark]: Witness Printer took 109.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:23:30,209 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.19 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 354.75 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: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.49 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 45.91 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 710.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2573.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 137.3 MB). Peak memory consumption was 137.3 MB. Max. memory is 7.1 GB. * Witness Printer took 109.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int b; VAL [\old(b)=0, b=0] [L13] _Bool k=__VERIFIER_nondet_bool(); [L14] int i,n,j; [L15] int a[1025]; VAL [b=0, k=32] [L17] COND TRUE \read(k) [L18] n=0 VAL [b=0, k=32, n=0] [L23] i=0 [L24] j=__VERIFIER_nondet_int() [L25] COND FALSE !(j > 10000) VAL [b=0, i=0, j=8191, k=32, n=0] [L28] COND TRUE i <= n [L29] i++ [L30] j= j +2 VAL [b=0, i=1, j=8193, k=32, n=0] [L28] COND FALSE !(i <= n) VAL [b=0, i=1, j=8193, k=32, n=0] [L33] a[i]=0 [L34] a[j]=0 VAL [b=0, i=1, j=8193, k=32, n=0] [L35] CALL __VERIFIER_assert(j<1025) VAL [\old(cond)=0, b=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, b=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, b=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 2.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 19 SDslu, 42 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 784 SizeOfPredicates, 4 NumberOfNonLiveVariables, 50 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...