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/trex01_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:24:30,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:24:30,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:24:30,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:24:30,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:24:30,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:24:30,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:24:30,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:24:30,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:24:30,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:24:30,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:24:30,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:24:30,311 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:24:30,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:24:30,313 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:24:30,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:24:30,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:24:30,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:24:30,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:24:30,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:24:30,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:24:30,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:24:30,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:24:30,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:24:30,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:24:30,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:24:30,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:24:30,330 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:24:30,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:24:30,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:24:30,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:24:30,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:24:30,333 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:24:30,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:24:30,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:24:30,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:24:30,336 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:24:30,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:24:30,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:24:30,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:24:30,354 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:24:30,355 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:24:30,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:24:30,355 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:24:30,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:24:30,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:24:30,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:24:30,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:24:30,356 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:24:30,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:24:30,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:24:30,357 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:24:30,357 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:24:30,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:24:30,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:24:30,358 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:24:30,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:24:30,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:24:30,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:24:30,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:24:30,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:24:30,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:30,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:24:30,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:24:30,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:24:30,360 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:24:30,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:24:30,360 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:24:30,360 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:24:30,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:24:30,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:24:30,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:24:30,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:24:30,445 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:24:30,445 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:24:30,446 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex01_false-unreach-call_true-termination.i [2018-11-23 11:24:30,520 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb39723a5/db104be4b4a94eabaa9434875500d279/FLAGca6c7fc38 [2018-11-23 11:24:30,993 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:24:30,994 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex01_false-unreach-call_true-termination.i [2018-11-23 11:24:31,001 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb39723a5/db104be4b4a94eabaa9434875500d279/FLAGca6c7fc38 [2018-11-23 11:24:31,337 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb39723a5/db104be4b4a94eabaa9434875500d279 [2018-11-23 11:24:31,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:24:31,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:24:31,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:31,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:24:31,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:24:31,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8176b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31, skipping insertion in model container [2018-11-23 11:24:31,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:24:31,395 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:24:31,626 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:31,632 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:24:31,658 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:31,675 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:24:31,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31 WrapperNode [2018-11-23 11:24:31,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:31,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:31,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:24:31,678 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:24:31,688 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:24:31" (1/1) ... [2018-11-23 11:24:31,696 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:24:31" (1/1) ... [2018-11-23 11:24:31,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:31,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:24:31,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:24:31,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:24:31,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (1/1) ... [2018-11-23 11:24:31,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:24:31,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:24:31,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:24:31,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:24:31,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (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:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:24:31,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 11:24:31,865 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:24:31,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:24:31,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:24:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:24:31,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:24:32,431 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:24:32,431 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:24:32,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:32 BoogieIcfgContainer [2018-11-23 11:24:32,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:24:32,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:24:32,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:24:32,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:24:32,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:24:31" (1/3) ... [2018-11-23 11:24:32,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b88dd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:32, skipping insertion in model container [2018-11-23 11:24:32,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:31" (2/3) ... [2018-11-23 11:24:32,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b88dd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:32, skipping insertion in model container [2018-11-23 11:24:32,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:32" (3/3) ... [2018-11-23 11:24:32,442 INFO L112 eAbstractionObserver]: Analyzing ICFG trex01_false-unreach-call_true-termination.i [2018-11-23 11:24:32,453 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:24:32,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:24:32,481 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:24:32,515 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:24:32,515 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:24:32,515 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:24:32,516 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:24:32,516 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:24:32,516 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:24:32,516 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:24:32,516 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:24:32,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:24:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 11:24:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:24:32,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:32,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:32,545 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:32,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash -355556993, now seen corresponding path program 1 times [2018-11-23 11:24:32,555 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:32,556 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:24:32,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:32,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:32,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 11:24:32,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 11:24:32,704 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #68#return; {31#true} is VALID [2018-11-23 11:24:32,705 INFO L256 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret6 := main(); {31#true} is VALID [2018-11-23 11:24:32,705 INFO L273 TraceCheckUtils]: 4: Hoare triple {31#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {31#true} is VALID [2018-11-23 11:24:32,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} assume !(0bv8 != ~c~1); {31#true} is VALID [2018-11-23 11:24:32,706 INFO L256 TraceCheckUtils]: 6: Hoare triple {31#true} call f(2bv32); {31#true} is VALID [2018-11-23 11:24:32,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {31#true} is VALID [2018-11-23 11:24:32,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#true} assume !!~bvsle32(~k~0, 1073741823bv32); {31#true} is VALID [2018-11-23 11:24:32,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 11:24:32,719 INFO L256 TraceCheckUtils]: 10: Hoare triple {32#false} call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); {32#false} is VALID [2018-11-23 11:24:32,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 11:24:32,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0bv32 == ~cond; {32#false} is VALID [2018-11-23 11:24:32,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 11:24:32,723 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:24:32,723 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:32,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:32,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:24:32,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:24:32,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:32,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:24:32,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:32,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:24:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:24:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:24:32,882 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 11:24:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:33,203 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-23 11:24:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:24:33,204 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:24:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2018-11-23 11:24:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2018-11-23 11:24:33,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 58 transitions. [2018-11-23 11:24:33,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:33,446 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:24:33,446 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:24:33,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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 11:24:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:24:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 11:24:33,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:33,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:33,579 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:33,579 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:33,583 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 11:24:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 11:24:33,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:33,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:33,587 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:33,587 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:33,590 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 11:24:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 11:24:33,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:33,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:33,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:33,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:24:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 11:24:33,597 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-11-23 11:24:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:33,598 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 11:24:33,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:24:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 11:24:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:24:33,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:33,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:33,600 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:33,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:33,600 INFO L82 PathProgramCache]: Analyzing trace with hash -359251077, now seen corresponding path program 1 times [2018-11-23 11:24:33,601 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:33,601 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:24:33,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:33,678 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #68#return; [?] CALL call #t~ret6 := main(); [?] ~c~1 := #t~nondet5;havoc #t~nondet5; VAL [main_~c~1=(_ bv0 8)] [?] assume !(0bv8 != ~c~1); VAL [main_~c~1=(_ bv0 8)] [?] CALL call f(2bv32); VAL [|f_#in~d|=(_ bv2 32)] [?] ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; VAL [f_~d=(_ bv2 32), f_~k~0=(_ bv2147483648 32), f_~x~0=(_ bv0 32), f_~y~0=(_ bv0 32), f_~z~0=(_ bv1 32), |f_#in~d|=(_ bv2 32)] [?] assume !!~bvsle32(~k~0, 1073741823bv32); VAL [f_~d=(_ bv2 32), f_~k~0=(_ bv2147483648 32), f_~x~0=(_ bv0 32), f_~y~0=(_ bv0 32), f_~z~0=(_ bv1 32), |f_#in~d|=(_ bv2 32)] [?] assume !~bvslt32(~z~0, ~k~0); VAL [f_~d=(_ bv2 32), f_~k~0=(_ bv2147483648 32), f_~x~0=(_ bv0 32), f_~y~0=(_ bv0 32), f_~z~0=(_ bv1 32), |f_#in~d|=(_ bv2 32)] [?] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] assume !(0bv8 != ~c~1); VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12-L13] assume !!~bvsle32(~k~0, 1073741823bv32); VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] assume !~bvslt32(~z~0, ~k~0); VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] assume !(0bv8 != ~c~1); VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12-L13] assume !!~bvsle32(~k~0, 1073741823bv32); VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] assume !~bvslt32(~z~0, ~k~0); VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] COND FALSE !(0bv8 != ~c~1) VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12] COND FALSE !(!~bvsle32(~k~0, 1073741823bv32)) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] COND TRUE !~bvslt32(~z~0, ~k~0) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] COND FALSE !(0bv8 != ~c~1) VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12] COND FALSE !(!~bvsle32(~k~0, 1073741823bv32)) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] COND TRUE !~bvslt32(~z~0, ~k~0) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] COND FALSE !(0bv8 != ~c~1) VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12] COND FALSE !(!~bvsle32(~k~0, 1073741823bv32)) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] COND TRUE !~bvslt32(~z~0, ~k~0) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] COND FALSE !(0bv8 != ~c~1) VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12] COND FALSE !(!~bvsle32(~k~0, 1073741823bv32)) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] COND TRUE !~bvslt32(~z~0, ~k~0) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L31] _Bool c = __VERIFIER_nondet_bool(); [L32] COND FALSE !(\read(c)) VAL [c=0] [L35] CALL f(2) VAL [\old(d)=2] [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L12] COND FALSE !(!(k <= 1073741823)) VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L15] COND FALSE !(z < k) VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L16] CALL __VERIFIER_assert(z>=2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:24:33,725 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:24:33,725 WARN L170 areAnnotationChecker]: fENTRY has no Hoare annotation [2018-11-23 11:24:33,725 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:33,726 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:33,726 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:24:33,726 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 11:24:33,726 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:24:33,726 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 11:24:33,726 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 11:24:33,727 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:33,727 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:33,727 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 11:24:33,727 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 11:24:33,727 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:24:33,727 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:24:33,731 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-23 11:24:33,731 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-23 11:24:33,732 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-23 11:24:33,732 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-23 11:24:33,732 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:24:33,732 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 11:24:33,732 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 11:24:33,733 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 11:24:33,733 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 11:24:33,733 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:33,733 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:33,733 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:24:33,733 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 11:24:33,734 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 11:24:33,734 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 11:24:33,734 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 11:24:33,734 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 11:24:33,734 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:24:33,735 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:24:33,735 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:24:33,735 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:24:33,735 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:24:33,735 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 11:24:33,736 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 11:24:33,736 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:24:33,736 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:24:33,736 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:24:33,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:24:33 BoogieIcfgContainer [2018-11-23 11:24:33,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:24:33,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:24:33,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:24:33,741 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:24:33,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:32" (3/4) ... [2018-11-23 11:24:33,745 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #68#return; [?] CALL call #t~ret6 := main(); [?] ~c~1 := #t~nondet5;havoc #t~nondet5; VAL [main_~c~1=(_ bv0 8)] [?] assume !(0bv8 != ~c~1); VAL [main_~c~1=(_ bv0 8)] [?] CALL call f(2bv32); VAL [|f_#in~d|=(_ bv2 32)] [?] ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; VAL [f_~d=(_ bv2 32), f_~k~0=(_ bv2147483648 32), f_~x~0=(_ bv0 32), f_~y~0=(_ bv0 32), f_~z~0=(_ bv1 32), |f_#in~d|=(_ bv2 32)] [?] assume !!~bvsle32(~k~0, 1073741823bv32); VAL [f_~d=(_ bv2 32), f_~k~0=(_ bv2147483648 32), f_~x~0=(_ bv0 32), f_~y~0=(_ bv0 32), f_~z~0=(_ bv1 32), |f_#in~d|=(_ bv2 32)] [?] assume !~bvslt32(~z~0, ~k~0); VAL [f_~d=(_ bv2 32), f_~k~0=(_ bv2147483648 32), f_~x~0=(_ bv0 32), f_~y~0=(_ bv0 32), f_~z~0=(_ bv1 32), |f_#in~d|=(_ bv2 32)] [?] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] assume !(0bv8 != ~c~1); VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12-L13] assume !!~bvsle32(~k~0, 1073741823bv32); VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] assume !~bvslt32(~z~0, ~k~0); VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] assume !(0bv8 != ~c~1); VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12-L13] assume !!~bvsle32(~k~0, 1073741823bv32); VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] assume !~bvslt32(~z~0, ~k~0); VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] COND FALSE !(0bv8 != ~c~1) VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12] COND FALSE !(!~bvsle32(~k~0, 1073741823bv32)) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] COND TRUE !~bvslt32(~z~0, ~k~0) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] COND FALSE !(0bv8 != ~c~1) VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12] COND FALSE !(!~bvsle32(~k~0, 1073741823bv32)) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] COND TRUE !~bvslt32(~z~0, ~k~0) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] COND FALSE !(0bv8 != ~c~1) VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12] COND FALSE !(!~bvsle32(~k~0, 1073741823bv32)) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] COND TRUE !~bvslt32(~z~0, ~k~0) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L31] ~c~1 := #t~nondet5; [L31] havoc #t~nondet5; VAL [~c~1=0bv8] [L32-L36] COND FALSE !(0bv8 != ~c~1) VAL [~c~1=0bv8] [L35] CALL call f(2bv32); VAL [#in~d=2bv32] [L10-L29] ~d := #in~d; [L11] ~x~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~y~0 := #t~nondet1; [L11] havoc #t~nondet1; [L11] ~k~0 := #t~nondet2; [L11] havoc #t~nondet2; [L11] ~z~0 := 1bv32; VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L12] COND FALSE !(!~bvsle32(~k~0, 1073741823bv32)) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L15] COND TRUE !~bvslt32(~z~0, ~k~0) VAL [#in~d=2bv32, ~d=2bv32, ~k~0=2147483648bv32, ~x~0=0bv32, ~y~0=0bv32, ~z~0=1bv32] [L16] CALL call __VERIFIER_assert((if ~bvsge32(~z~0, 2bv32) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L31] _Bool c = __VERIFIER_nondet_bool(); [L32] COND FALSE !(\read(c)) VAL [c=0] [L35] CALL f(2) VAL [\old(d)=2] [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L12] COND FALSE !(!(k <= 1073741823)) VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L15] COND FALSE !(z < k) VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L16] CALL __VERIFIER_assert(z>=2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:24:33,812 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/trex01_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:24:33,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:24:33,815 INFO L168 Benchmark]: Toolchain (without parser) took 2466.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -681.8 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:33,819 INFO L168 Benchmark]: CDTParser took 0.24 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:24:33,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:33,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.37 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:24:33,821 INFO L168 Benchmark]: Boogie Preprocessor took 34.85 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:24:33,822 INFO L168 Benchmark]: RCFGBuilder took 693.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:33,823 INFO L168 Benchmark]: TraceAbstraction took 1305.98 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: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:33,824 INFO L168 Benchmark]: Witness Printer took 71.77 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:24:33,829 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.24 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 325.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.37 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 34.85 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 693.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1305.98 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: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. * Witness Printer took 71.77 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: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] _Bool c = __VERIFIER_nondet_bool(); [L32] COND FALSE !(\read(c)) VAL [c=0] [L35] CALL f(2) VAL [\old(d)=2] [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; [L11] int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1; VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L12] COND FALSE !(!(k <= 1073741823)) VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L15] COND FALSE !(z < k) VAL [\old(d)=2, d=2, k=-2147483648, x=0, y=0, z=1] [L16] CALL __VERIFIER_assert(z>=2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. UNSAFE Result, 1.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 28 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...