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_Default.epf -i ../../../trunk/examples/svcomp/loops/terminator_03_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:56,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:56,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:56,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:56,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:56,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:56,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:56,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:56,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:56,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:56,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:56,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:56,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:56,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:56,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:56,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:56,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:56,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:56,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:56,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:56,589 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:56,591 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:56,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:56,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:56,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:56,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:56,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:56,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:56,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:56,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:56,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:56,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:56,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:56,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:56,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:56,603 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:56,603 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:56,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:56,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:56,618 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:56,619 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:56,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:56,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:56,619 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:56,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:56,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:56,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:56,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:56,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:56,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:56,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:56,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:56,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:56,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:56,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:56,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:56,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:56,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:56,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:56,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:56,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:56,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:56,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:56,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:56,624 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:56,624 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:56,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:56,624 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:56,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:56,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:56,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:56,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:56,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:56,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/terminator_03_false-unreach-call_true-termination.i [2018-11-23 13:02:56,763 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3364b567/063f869685f74535bd69ff964117369c/FLAGadf2f024d [2018-11-23 13:02:57,218 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:57,225 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/terminator_03_false-unreach-call_true-termination.i [2018-11-23 13:02:57,232 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3364b567/063f869685f74535bd69ff964117369c/FLAGadf2f024d [2018-11-23 13:02:57,610 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3364b567/063f869685f74535bd69ff964117369c [2018-11-23 13:02:57,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:57,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:57,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:57,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:57,625 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:57,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0b3694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57, skipping insertion in model container [2018-11-23 13:02:57,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:57,664 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:57,844 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:57,848 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:57,869 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:57,886 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:57,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57 WrapperNode [2018-11-23 13:02:57,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:57,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:57,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:57,888 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:57,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:57,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:57,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:57,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:57,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:57,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:57,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:57,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:57,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (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 13:02:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:58,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:58,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:58,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:58,493 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:58,494 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:58,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:58 BoogieIcfgContainer [2018-11-23 13:02:58,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:58,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:58,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:58,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:58,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:57" (1/3) ... [2018-11-23 13:02:58,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a053f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:58, skipping insertion in model container [2018-11-23 13:02:58,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (2/3) ... [2018-11-23 13:02:58,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a053f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:58, skipping insertion in model container [2018-11-23 13:02:58,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:58" (3/3) ... [2018-11-23 13:02:58,503 INFO L112 eAbstractionObserver]: Analyzing ICFG terminator_03_false-unreach-call_true-termination.i [2018-11-23 13:02:58,511 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:58,517 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:58,534 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:58,564 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:58,565 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:58,565 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:58,566 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:58,566 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:58,566 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:58,566 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:58,566 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:58,567 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:02:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:02:58,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:58,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:58,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:58,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2018-11-23 13:02:58,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:58,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:58,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:58,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:02:58,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:02:58,888 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #38#return; {22#true} is VALID [2018-11-23 13:02:58,888 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 13:02:58,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {22#true} is VALID [2018-11-23 13:02:58,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !(~y~0 > 0); {24#(<= main_~y~0 0)} is VALID [2018-11-23 13:02:58,894 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#(<= main_~y~0 0)} call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); {25#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:02:58,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:02:58,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:02:58,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:02:58,900 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 13:02:58,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:58,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:02:58,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:02:58,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:58,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:58,963 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 13:02:58,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:58,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:58,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:58,977 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2018-11-23 13:02:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:59,545 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 13:02:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:59,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:02:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 13:02:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 13:02:59,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2018-11-23 13:02:59,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:59,750 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:02:59,750 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:02:59,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:02:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:02:59,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:59,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:02:59,814 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:02:59,814 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:02:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:59,817 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:02:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:02:59,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:59,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:59,818 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:02:59,818 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:02:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:59,821 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:02:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:02:59,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:59,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:59,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:59,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:02:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:02:59,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:02:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:59,828 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:02:59,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:02:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:02:59,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:59,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:59,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:59,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:59,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1117320769, now seen corresponding path program 1 times [2018-11-23 13:02:59,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:59,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:59,868 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #38#return; [?] CALL call #t~ret2 := main(); [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~x~0=100, main_~y~0=1] [?] assume ~y~0 > 0; VAL [main_~x~0=100, main_~y~0=1] [?] assume !(~x~0 < 100); VAL [main_~x~0=100, main_~y~0=1] [?] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16-L22] assume ~y~0 > 0; VAL [~x~0=100, ~y~0=1] [L18-L21] assume !(~x~0 < 100); VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16-L22] assume ~y~0 > 0; VAL [~x~0=100, ~y~0=1] [L18-L21] assume !(~x~0 < 100); VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1] [L18] COND FALSE !(x<100) VAL [x=100, y=1] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:02:59,898 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:02:59,898 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:59,898 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:59,898 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:02:59,898 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:02:59,899 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:02:59,899 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:59,899 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:59,899 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:02:59,899 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:02:59,899 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:59,899 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:59,900 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:02:59,900 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 13:02:59,900 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 13:02:59,900 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 13:02:59,900 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 13:02:59,900 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 13:02:59,900 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:59,900 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:59,901 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:02:59,901 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:02:59,901 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:02:59,901 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:02:59,901 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:02:59,901 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 13:02:59,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:02:59 BoogieIcfgContainer [2018-11-23 13:02:59,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:02:59,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:02:59,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:02:59,904 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:02:59,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:58" (3/4) ... [2018-11-23 13:02:59,907 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 #38#return; [?] CALL call #t~ret2 := main(); [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~x~0=100, main_~y~0=1] [?] assume ~y~0 > 0; VAL [main_~x~0=100, main_~y~0=1] [?] assume !(~x~0 < 100); VAL [main_~x~0=100, main_~y~0=1] [?] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16-L22] assume ~y~0 > 0; VAL [~x~0=100, ~y~0=1] [L18-L21] assume !(~x~0 < 100); VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16-L22] assume ~y~0 > 0; VAL [~x~0=100, ~y~0=1] [L18-L21] assume !(~x~0 < 100); VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1] [L18] COND FALSE !(x<100) VAL [x=100, y=1] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:02:59,953 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/terminator_03_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:02:59,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:02:59,955 INFO L168 Benchmark]: Toolchain (without parser) took 2335.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -693.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:59,957 INFO L168 Benchmark]: CDTParser took 0.25 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 13:02:59,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.84 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 13:02:59,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.60 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 13:02:59,959 INFO L168 Benchmark]: Boogie Preprocessor took 23.22 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 13:02:59,959 INFO L168 Benchmark]: RCFGBuilder took 558.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:59,960 INFO L168 Benchmark]: TraceAbstraction took 1408.70 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:59,961 INFO L168 Benchmark]: Witness Printer took 49.60 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:59,965 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.25 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. * CACSL2BoogieTranslator took 265.84 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 23.60 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 23.22 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 558.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1408.70 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. * Witness Printer took 49.60 ms. Allocated memory is still 2.2 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: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1] [L18] COND FALSE !(x<100) VAL [x=100, y=1] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 1.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 7 SDslu, 49 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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.2s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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...