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/trex02_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:24:32,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:24:32,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:24:32,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:24:32,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:24:32,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:24:32,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:24:32,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:24:32,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:24:32,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:24:32,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:24:32,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:24:32,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:24:32,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:24:32,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:24:32,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:24:32,436 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:24:32,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:24:32,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:24:32,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:24:32,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:24:32,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:24:32,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:24:32,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:24:32,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:24:32,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:24:32,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:24:32,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:24:32,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:24:32,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:24:32,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:24:32,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:24:32,457 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:24:32,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:24:32,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:24:32,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:24:32,463 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:32,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:24:32,494 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:24:32,495 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:24:32,495 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:24:32,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:24:32,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:24:32,497 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:24:32,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:24:32,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:24:32,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:24:32,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:24:32,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:24:32,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:24:32,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:24:32,498 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:24:32,499 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:24:32,499 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:24:32,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:24:32,500 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:24:32,500 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:24:32,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:24:32,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:24:32,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:24:32,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:24:32,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:32,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:24:32,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:24:32,503 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:24:32,503 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:24:32,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:24:32,503 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:24:32,503 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:24:32,504 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:24:32,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:24:32,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:24:32,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:24:32,579 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:24:32,580 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:24:32,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex02_false-unreach-call_true-termination.i [2018-11-23 11:24:32,642 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca15b980/d5a5fb595bff47d5b035a29c44ccb841/FLAG05add963c [2018-11-23 11:24:33,093 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:24:33,093 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex02_false-unreach-call_true-termination.i [2018-11-23 11:24:33,100 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca15b980/d5a5fb595bff47d5b035a29c44ccb841/FLAG05add963c [2018-11-23 11:24:33,451 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca15b980/d5a5fb595bff47d5b035a29c44ccb841 [2018-11-23 11:24:33,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:24:33,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:24:33,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:33,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:24:33,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:24:33,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:33" (1/1) ... [2018-11-23 11:24:33,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c04e15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:33, skipping insertion in model container [2018-11-23 11:24:33,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:33" (1/1) ... [2018-11-23 11:24:33,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:24:33,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:24:33,712 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:33,720 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:24:33,739 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:33,757 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:24:33,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:33 WrapperNode [2018-11-23 11:24:33,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:33,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:33,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:24:33,759 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:24:33,769 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:33" (1/1) ... [2018-11-23 11:24:33,777 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:33" (1/1) ... [2018-11-23 11:24:33,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:33,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:24:33,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:24:33,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:24:33,796 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:33" (1/1) ... [2018-11-23 11:24:33,796 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:33" (1/1) ... [2018-11-23 11:24:33,797 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:33" (1/1) ... [2018-11-23 11:24:33,798 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:33" (1/1) ... [2018-11-23 11:24:33,805 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:33" (1/1) ... [2018-11-23 11:24:33,811 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:33" (1/1) ... [2018-11-23 11:24:33,812 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:33" (1/1) ... [2018-11-23 11:24:33,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:24:33,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:24:33,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:24:33,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:24:33,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:33" (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:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:24:33,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:24:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 11:24:33,946 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 11:24:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:24:33,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:24:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:24:33,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:24:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:24:33,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:24:34,420 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:24:34,420 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:24:34,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:34 BoogieIcfgContainer [2018-11-23 11:24:34,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:24:34,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:24:34,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:24:34,425 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:24:34,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:24:33" (1/3) ... [2018-11-23 11:24:34,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f0240b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:34, skipping insertion in model container [2018-11-23 11:24:34,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:33" (2/3) ... [2018-11-23 11:24:34,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f0240b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:34, skipping insertion in model container [2018-11-23 11:24:34,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:34" (3/3) ... [2018-11-23 11:24:34,430 INFO L112 eAbstractionObserver]: Analyzing ICFG trex02_false-unreach-call_true-termination.i [2018-11-23 11:24:34,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:24:34,447 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:24:34,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:24:34,502 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:24:34,503 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:24:34,503 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:24:34,503 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:24:34,504 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:24:34,504 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:24:34,504 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:24:34,504 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:24:34,504 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:24:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 11:24:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:24:34,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:34,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:34,535 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:34,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1873481772, now seen corresponding path program 1 times [2018-11-23 11:24:34,546 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:34,547 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:34,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:34,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:34,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 11:24:34,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} ~x~0 := 0bv32; {27#true} is VALID [2018-11-23 11:24:34,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 11:24:34,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2018-11-23 11:24:34,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret3 := main(); {27#true} is VALID [2018-11-23 11:24:34,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} ~x~0 := #t~nondet1;havoc #t~nondet1; {27#true} is VALID [2018-11-23 11:24:34,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 11:24:34,684 INFO L256 TraceCheckUtils]: 7: Hoare triple {28#false} call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 11:24:34,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 11:24:34,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 11:24:34,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 11:24:34,690 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:34,690 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:34,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:34,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:24:34,700 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:24:34,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:34,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:24:34,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:34,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:24:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:24:34,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:24:34,758 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 11:24:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:34,875 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 11:24:34,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:24:34,875 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:24:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2018-11-23 11:24:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2018-11-23 11:24:34,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 40 transitions. [2018-11-23 11:24:35,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:35,249 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:24:35,249 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:24:35,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:24:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:24:35,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:35,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:24:35,308 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:24:35,308 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:24:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:35,313 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 11:24:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:24:35,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:35,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:35,314 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:24:35,315 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:24:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:35,319 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 11:24:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:24:35,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:35,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:35,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:35,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:24:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-23 11:24:35,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-23 11:24:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:35,327 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 11:24:35,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:24:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:24:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:24:35,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:35,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:35,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:35,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:35,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1862399520, now seen corresponding path program 1 times [2018-11-23 11:24:35,330 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:35,330 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:35,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:35,423 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv0 32)] [?] ~x~0 := 0bv32; VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv0 32)] [?] assume true; VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv0 32)] [?] RET #42#return; VAL [~x~0=(_ bv0 32)] [?] CALL call #t~ret3 := main(); VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv0 32)] [?] ~x~0 := #t~nondet1;havoc #t~nondet1; VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] assume !~bvsgt32(~x~0, 0bv32); VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] ensures true; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] assume !~bvsgt32(~x~0, 0bv32); VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] ensures true; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] assume !~bvsgt32(~x~0, 0bv32); VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] COND TRUE !~bvsgt32(~x~0, 0bv32) VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] COND TRUE !~bvsgt32(~x~0, 0bv32) VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] COND TRUE !~bvsgt32(~x~0, 0bv32) VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] COND TRUE !~bvsgt32(~x~0, 0bv32) VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L10] int x; VAL [\old(x)=0, x=0] [L15] x=__VERIFIER_nondet_int() [L16] COND FALSE !(x > 0) VAL [\old(x)=0, x=2147483648] [L21] CALL __VERIFIER_assert(x==0) VAL [\old(cond)=0, \old(x)=0, x=2147483648] [L3] COND TRUE !(cond) VAL [\old(cond)=0, \old(x)=0, cond=0, x=2147483648] [L4] __VERIFIER_error() VAL [\old(cond)=0, \old(x)=0, cond=0, x=2147483648] ----- [2018-11-23 11:24:35,469 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:24:35,470 WARN L170 areAnnotationChecker]: fooENTRY has no Hoare annotation [2018-11-23 11:24:35,470 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:35,470 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:35,470 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:24:35,470 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 11:24:35,470 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:24:35,471 WARN L170 areAnnotationChecker]: fooFINAL has no Hoare annotation [2018-11-23 11:24:35,471 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:35,471 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:35,471 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 11:24:35,471 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 11:24:35,471 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 11:24:35,471 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:24:35,472 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:24:35,472 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:24:35,472 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2018-11-23 11:24:35,472 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2018-11-23 11:24:35,472 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:24:35,472 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:24:35,472 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:24:35,473 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:24:35,473 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:24:35,473 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:35,473 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:35,473 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:24:35,473 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:24:35,473 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-23 11:24:35,474 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-23 11:24:35,474 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 11:24:35,474 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 11:24:35,474 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:24:35,474 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:24:35,474 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:35,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:24:35 BoogieIcfgContainer [2018-11-23 11:24:35,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:24:35,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:24:35,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:24:35,478 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:24:35,478 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:34" (3/4) ... [2018-11-23 11:24:35,481 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv0 32)] [?] ~x~0 := 0bv32; VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv0 32)] [?] assume true; VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv0 32)] [?] RET #42#return; VAL [~x~0=(_ bv0 32)] [?] CALL call #t~ret3 := main(); VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv0 32)] [?] ~x~0 := #t~nondet1;havoc #t~nondet1; VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] assume !~bvsgt32(~x~0, 0bv32); VAL [|old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~x~0)|=(_ bv0 32), ~x~0=(_ bv2147483648 32)] [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] ensures true; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] assume !~bvsgt32(~x~0, 0bv32); VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] ensures true; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] assume !~bvsgt32(~x~0, 0bv32); VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] COND TRUE !~bvsgt32(~x~0, 0bv32) VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] COND TRUE !~bvsgt32(~x~0, 0bv32) VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] COND TRUE !~bvsgt32(~x~0, 0bv32) VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L10] ~x~0 := 0bv32; VAL [old(~x~0)=0bv32, ~x~0=0bv32] [?] RET call ULTIMATE.init(); VAL [~x~0=0bv32] [?] CALL call #t~ret3 := main(); VAL [old(~x~0)=0bv32, ~x~0=0bv32] [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L16-L20] COND TRUE !~bvsgt32(~x~0, 0bv32) VAL [old(~x~0)=0bv32, ~x~0=2147483648bv32] [L21] CALL call __VERIFIER_assert((if 0bv32 == ~x~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~x~0=2147483648bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L4] assert false; VAL [#in~cond=0bv32, old(~x~0)=0bv32, ~cond=0bv32, ~x~0=2147483648bv32] [L10] int x; VAL [\old(x)=0, x=0] [L15] x=__VERIFIER_nondet_int() [L16] COND FALSE !(x > 0) VAL [\old(x)=0, x=2147483648] [L21] CALL __VERIFIER_assert(x==0) VAL [\old(cond)=0, \old(x)=0, x=2147483648] [L3] COND TRUE !(cond) VAL [\old(cond)=0, \old(x)=0, cond=0, x=2147483648] [L4] __VERIFIER_error() VAL [\old(cond)=0, \old(x)=0, cond=0, x=2147483648] ----- [2018-11-23 11:24:35,536 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/trex02_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:24:35,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:24:35,539 INFO L168 Benchmark]: Toolchain (without parser) took 2077.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -700.8 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:35,541 INFO L168 Benchmark]: CDTParser took 0.22 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:35,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.89 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:35,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.95 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:35,543 INFO L168 Benchmark]: Boogie Preprocessor took 28.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:35,543 INFO L168 Benchmark]: RCFGBuilder took 606.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:35,544 INFO L168 Benchmark]: TraceAbstraction took 1055.10 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.6 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:35,545 INFO L168 Benchmark]: Witness Printer took 59.62 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:35,550 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.22 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 295.89 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 25.95 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 28.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 606.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1055.10 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.6 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. * Witness Printer took 59.62 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: [L10] int x; VAL [\old(x)=0, x=0] [L15] x=__VERIFIER_nondet_int() [L16] COND FALSE !(x > 0) VAL [\old(x)=0, x=2147483648] [L21] CALL __VERIFIER_assert(x==0) VAL [\old(cond)=0, \old(x)=0, x=2147483648] [L3] COND TRUE !(cond) VAL [\old(cond)=0, \old(x)=0, cond=0, x=2147483648] [L4] __VERIFIER_error() VAL [\old(cond)=0, \old(x)=0, cond=0, x=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. UNSAFE Result, 0.9s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 19 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...