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/trex03_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:24:36,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:24:36,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:24:36,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:24:36,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:24:36,376 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:24:36,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:24:36,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:24:36,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:24:36,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:24:36,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:24:36,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:24:36,384 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:24:36,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:24:36,386 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:24:36,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:24:36,387 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:24:36,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:24:36,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:24:36,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:24:36,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:24:36,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:24:36,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:24:36,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:24:36,399 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:24:36,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:24:36,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:24:36,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:24:36,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:24:36,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:24:36,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:24:36,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:24:36,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:24:36,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:24:36,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:24:36,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:24:36,407 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:36,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:24:36,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:24:36,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:24:36,425 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:24:36,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:24:36,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:24:36,427 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:24:36,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:24:36,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:24:36,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:24:36,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:24:36,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:24:36,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:24:36,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:24:36,430 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:24:36,430 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:24:36,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:24:36,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:24:36,430 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:24:36,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:24:36,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:24:36,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:24:36,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:24:36,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:24:36,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:36,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:24:36,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:24:36,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:24:36,434 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:24:36,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:24:36,434 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:24:36,434 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:24:36,435 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:24:36,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:24:36,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:24:36,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:24:36,511 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:24:36,512 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:24:36,513 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex03_false-unreach-call_true-termination.i [2018-11-23 11:24:36,584 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a134c4a78/62f38cebfbdd4950a90df66de6623e57/FLAG0232f2cb7 [2018-11-23 11:24:37,071 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:24:37,072 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex03_false-unreach-call_true-termination.i [2018-11-23 11:24:37,077 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a134c4a78/62f38cebfbdd4950a90df66de6623e57/FLAG0232f2cb7 [2018-11-23 11:24:37,414 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a134c4a78/62f38cebfbdd4950a90df66de6623e57 [2018-11-23 11:24:37,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:24:37,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:24:37,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:37,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:24:37,430 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:24:37,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:37" (1/1) ... [2018-11-23 11:24:37,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e75a9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:37, skipping insertion in model container [2018-11-23 11:24:37,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:37" (1/1) ... [2018-11-23 11:24:37,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:24:37,467 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:24:37,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:37,756 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:24:37,784 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:37,807 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:24:37,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:37 WrapperNode [2018-11-23 11:24:37,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:37,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:37,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:24:37,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:24:37,822 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:37" (1/1) ... [2018-11-23 11:24:37,833 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:37" (1/1) ... [2018-11-23 11:24:37,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:37,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:24:37,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:24:37,842 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:24:37,854 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:37" (1/1) ... [2018-11-23 11:24:37,854 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:37" (1/1) ... [2018-11-23 11:24:37,856 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:37" (1/1) ... [2018-11-23 11:24:37,856 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:37" (1/1) ... [2018-11-23 11:24:37,866 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:37" (1/1) ... [2018-11-23 11:24:37,873 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:37" (1/1) ... [2018-11-23 11:24:37,875 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:37" (1/1) ... [2018-11-23 11:24:37,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:24:37,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:24:37,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:24:37,878 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:24:37,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:24:38,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:24:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:24:38,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:24:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:24:38,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:24:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:24:38,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:24:38,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:24:38,519 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:24:38,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:38 BoogieIcfgContainer [2018-11-23 11:24:38,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:24:38,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:24:38,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:24:38,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:24:38,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:24:37" (1/3) ... [2018-11-23 11:24:38,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea5281b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:38, skipping insertion in model container [2018-11-23 11:24:38,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:37" (2/3) ... [2018-11-23 11:24:38,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea5281b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:38, skipping insertion in model container [2018-11-23 11:24:38,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:38" (3/3) ... [2018-11-23 11:24:38,532 INFO L112 eAbstractionObserver]: Analyzing ICFG trex03_false-unreach-call_true-termination.i [2018-11-23 11:24:38,542 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:24:38,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:24:38,570 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:24:38,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:24:38,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:24:38,614 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:24:38,615 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:24:38,615 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:24:38,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:24:38,615 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:24:38,615 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:24:38,616 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:24:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:24:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:24:38,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:38,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:38,646 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:38,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash -859010367, now seen corresponding path program 1 times [2018-11-23 11:24:38,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:38,656 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:38,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:38,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:38,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:24:38,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:24:38,783 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2018-11-23 11:24:38,784 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID [2018-11-23 11:24:38,784 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} ~x1~0 := #t~nondet0;havoc #t~nondet0;~x2~0 := #t~nondet1;havoc #t~nondet1;~x3~0 := #t~nondet2;havoc #t~nondet2;~d1~0 := 1bv32;~d2~0 := 1bv32;~d3~0 := 1bv32;~c1~0 := #t~nondet3;havoc #t~nondet3;~c2~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2018-11-23 11:24:38,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 11:24:38,787 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 then 1bv32 else 0bv32)); {25#false} is VALID [2018-11-23 11:24:38,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 11:24:38,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2018-11-23 11:24:38,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:24:38,791 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:38,791 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:38,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:38,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:24:38,802 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:24:38,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:38,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:24:38,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:38,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:24:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:24:38,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:24:38,861 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 11:24:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:39,097 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 11:24:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:24:39,098 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:24:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 11:24:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 11:24:39,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-23 11:24:39,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:39,440 INFO L225 Difference]: With dead ends: 33 [2018-11-23 11:24:39,440 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:24:39,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:24:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:24:39,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:39,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:24:39,495 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:24:39,495 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:24:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:39,498 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 11:24:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 11:24:39,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:39,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:39,499 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:24:39,499 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:24:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:39,503 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 11:24:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 11:24:39,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:39,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:39,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:39,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:24:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-23 11:24:39,508 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2018-11-23 11:24:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:39,508 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 11:24:39,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:24:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 11:24:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:24:39,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:39,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:39,510 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:39,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2018-11-23 11:24:39,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:39,511 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:39,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:39,581 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #44#return; [?] CALL call #t~ret7 := main(); [?] ~x1~0 := #t~nondet0;havoc #t~nondet0;~x2~0 := #t~nondet1;havoc #t~nondet1;~x3~0 := #t~nondet2;havoc #t~nondet2;~d1~0 := 1bv32;~d2~0 := 1bv32;~d3~0 := 1bv32;~c1~0 := #t~nondet3;havoc #t~nondet3;~c2~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~c1~0=(_ bv0 8), main_~c2~0=(_ bv0 8), main_~d1~0=(_ bv1 32), main_~d2~0=(_ bv1 32), main_~d3~0=(_ bv1 32), main_~x1~0=(_ bv1 32), main_~x2~0=(_ bv0 32), main_~x3~0=(_ bv0 32)] [?] assume !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)); VAL [main_~c1~0=(_ bv0 8), main_~c2~0=(_ bv0 8), main_~d1~0=(_ bv1 32), main_~d2~0=(_ bv1 32), main_~d3~0=(_ bv1 32), main_~x1~0=(_ bv1 32), main_~x2~0=(_ bv0 32), main_~x3~0=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] assume !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)); VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] assume !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)); VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] COND TRUE !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)) VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] COND TRUE !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)) VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] COND TRUE !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)) VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] COND TRUE !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)) VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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] [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L13] unsigned int d1=1, d2=1, d3=1; [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L15] COND FALSE !(x1>0 && x2>0 && x3>0) VAL [c1=0, c2=0, d1=1, d2=1, d3=1, x1=1, x2=0, x3=0] [L23] CALL __VERIFIER_assert(x1==0 && x2==0 && x3==0) 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:39,646 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:24:39,647 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:39,647 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:39,647 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:24:39,647 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 11:24:39,647 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:24:39,647 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:39,647 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:39,648 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 11:24:39,648 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 11:24:39,648 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 11:24:39,648 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:24:39,648 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:24:39,648 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:24:39,648 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2018-11-23 11:24:39,649 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2018-11-23 11:24:39,649 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:24:39,649 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:24:39,649 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:39,649 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:39,649 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:24:39,649 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 11:24:39,650 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:24:39,650 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:24:39,650 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:24:39,650 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:24:39,650 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:24:39,650 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:24:39,650 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:39,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:24:39 BoogieIcfgContainer [2018-11-23 11:24:39,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:24:39,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:24:39,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:24:39,654 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:24:39,654 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:38" (3/4) ... [2018-11-23 11:24:39,660 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 #44#return; [?] CALL call #t~ret7 := main(); [?] ~x1~0 := #t~nondet0;havoc #t~nondet0;~x2~0 := #t~nondet1;havoc #t~nondet1;~x3~0 := #t~nondet2;havoc #t~nondet2;~d1~0 := 1bv32;~d2~0 := 1bv32;~d3~0 := 1bv32;~c1~0 := #t~nondet3;havoc #t~nondet3;~c2~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~c1~0=(_ bv0 8), main_~c2~0=(_ bv0 8), main_~d1~0=(_ bv1 32), main_~d2~0=(_ bv1 32), main_~d3~0=(_ bv1 32), main_~x1~0=(_ bv1 32), main_~x2~0=(_ bv0 32), main_~x3~0=(_ bv0 32)] [?] assume !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)); VAL [main_~c1~0=(_ bv0 8), main_~c2~0=(_ bv0 8), main_~d1~0=(_ bv1 32), main_~d2~0=(_ bv1 32), main_~d3~0=(_ bv1 32), main_~x1~0=(_ bv1 32), main_~x2~0=(_ bv0 32), main_~x3~0=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] assume !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)); VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] assume !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)); VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] COND TRUE !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)) VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] COND TRUE !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)) VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] COND TRUE !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)) VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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~ret7 := main(); [L12] ~x1~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~x2~0 := #t~nondet1; [L12] havoc #t~nondet1; [L12] ~x3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] ~d1~0 := 1bv32; [L13] ~d2~0 := 1bv32; [L13] ~d3~0 := 1bv32; [L14] ~c1~0 := #t~nondet3; [L14] havoc #t~nondet3; [L14] ~c2~0 := #t~nondet4; [L14] havoc #t~nondet4; VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L15-L22] COND TRUE !((~bvugt32(~x1~0, 0bv32) && ~bvugt32(~x2~0, 0bv32)) && ~bvugt32(~x3~0, 0bv32)) VAL [~c1~0=0bv8, ~c2~0=0bv8, ~d1~0=1bv32, ~d2~0=1bv32, ~d3~0=1bv32, ~x1~0=1bv32, ~x2~0=0bv32, ~x3~0=0bv32] [L23] CALL call __VERIFIER_assert((if (0bv32 == ~x1~0 && 0bv32 == ~x2~0) && 0bv32 == ~x3~0 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] [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L13] unsigned int d1=1, d2=1, d3=1; [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L15] COND FALSE !(x1>0 && x2>0 && x3>0) VAL [c1=0, c2=0, d1=1, d2=1, d3=1, x1=1, x2=0, x3=0] [L23] CALL __VERIFIER_assert(x1==0 && x2==0 && x3==0) 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:39,716 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/trex03_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:24:39,716 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:24:39,717 INFO L168 Benchmark]: Toolchain (without parser) took 2293.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -706.3 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:39,719 INFO L168 Benchmark]: CDTParser took 1.18 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:39,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.78 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:39,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.70 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:39,721 INFO L168 Benchmark]: Boogie Preprocessor took 35.67 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:39,722 INFO L168 Benchmark]: RCFGBuilder took 642.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:39,723 INFO L168 Benchmark]: TraceAbstraction took 1131.19 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: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:39,723 INFO L168 Benchmark]: Witness Printer took 62.71 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:39,728 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 1.18 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 382.78 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 31.70 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 35.67 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 642.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1131.19 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: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 7.1 GB. * Witness Printer took 62.71 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: [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L12] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L13] unsigned int d1=1, d2=1, d3=1; [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L14] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L15] COND FALSE !(x1>0 && x2>0 && x3>0) VAL [c1=0, c2=0, d1=1, d2=1, d3=1, x1=1, x2=0, x3=0] [L23] CALL __VERIFIER_assert(x1==0 && x2==0 && x3==0) 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 4 procedures, 21 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 25 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...