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/ldv-regression/test_while_int_true-termination.c_false-unreach-call_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:41,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:41,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:41,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:41,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:41,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:41,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:41,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:41,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:41,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:41,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:41,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:41,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:41,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:41,916 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:41,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:41,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:41,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:41,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:41,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:41,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:41,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:41,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:41,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:41,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:41,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:41,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:41,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:41,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:41,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:41,940 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:41,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:41,941 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:41,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:41,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:41,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:41,943 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 12:53:41,958 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:41,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:41,959 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:41,959 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:41,960 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:41,960 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:41,960 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:41,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:41,961 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:41,961 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:41,961 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:41,961 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:41,961 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:41,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:41,962 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:41,962 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:41,962 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:41,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:41,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:41,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:41,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:41,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:41,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:41,965 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:41,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:41,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:41,966 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:42,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:42,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:42,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:42,056 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:42,057 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:42,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call_1.i [2018-11-23 12:53:42,114 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f41a891f/85b79e09e3e84e408f7684e058f25937/FLAG62cc53295 [2018-11-23 12:53:42,520 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:42,521 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call_1.i [2018-11-23 12:53:42,526 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f41a891f/85b79e09e3e84e408f7684e058f25937/FLAG62cc53295 [2018-11-23 12:53:42,897 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f41a891f/85b79e09e3e84e408f7684e058f25937 [2018-11-23 12:53:42,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:42,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:42,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:42,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:42,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:42,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:42" (1/1) ... [2018-11-23 12:53:42,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea32f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:42, skipping insertion in model container [2018-11-23 12:53:42,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:42" (1/1) ... [2018-11-23 12:53:42,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:42,950 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:43,144 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:43,149 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:43,166 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:43,182 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:43,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43 WrapperNode [2018-11-23 12:53:43,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:43,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:43,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:43,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:43,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:43,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:43,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:43,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:43,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:43,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:43,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:43,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:43,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (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 12:53:43,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:43,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:43,346 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 12:53:43,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 12:53:43,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:43,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:43,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:43,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:43,697 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:43,697 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:53:43,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:43 BoogieIcfgContainer [2018-11-23 12:53:43,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:43,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:43,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:43,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:43,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:42" (1/3) ... [2018-11-23 12:53:43,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba7f00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:43, skipping insertion in model container [2018-11-23 12:53:43,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (2/3) ... [2018-11-23 12:53:43,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba7f00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:43, skipping insertion in model container [2018-11-23 12:53:43,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:43" (3/3) ... [2018-11-23 12:53:43,706 INFO L112 eAbstractionObserver]: Analyzing ICFG test_while_int_true-termination.c_false-unreach-call_1.i [2018-11-23 12:53:43,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:43,722 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:43,736 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:43,768 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:43,768 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:43,769 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:43,769 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:43,769 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:43,769 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:43,769 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:43,769 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:43,770 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 12:53:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 12:53:43,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:43,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:43,798 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:43,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:43,804 INFO L82 PathProgramCache]: Analyzing trace with hash 676687463, now seen corresponding path program 1 times [2018-11-23 12:53:43,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:43,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:43,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:43,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:43,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:44,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 12:53:44,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 12:53:44,080 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #30#return; {20#true} is VALID [2018-11-23 12:53:44,080 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 12:53:44,082 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~i~0 := 0; {22#(<= main_~i~0 0)} is VALID [2018-11-23 12:53:44,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:44,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#(<= main_~i~0 1)} assume !(3 != ~i~0); {21#false} is VALID [2018-11-23 12:53:44,089 INFO L256 TraceCheckUtils]: 7: Hoare triple {21#false} call __blast_assert(); {21#false} is VALID [2018-11-23 12:53:44,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 12:53:44,092 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 12:53:44,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:44,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:53:44,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-23 12:53:44,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:44,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:53:44,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:44,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:53:44,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:53:44,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:53:44,170 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2018-11-23 12:53:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:44,438 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2018-11-23 12:53:44,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:53:44,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-23 12:53:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 12:53:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 12:53:44,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2018-11-23 12:53:44,698 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 12:53:44,710 INFO L225 Difference]: With dead ends: 30 [2018-11-23 12:53:44,711 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 12:53:44,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:53:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 12:53:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-23 12:53:44,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:44,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 12 states. [2018-11-23 12:53:44,808 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 12 states. [2018-11-23 12:53:44,809 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 12 states. [2018-11-23 12:53:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:44,812 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 12:53:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 12:53:44,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:44,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:44,813 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states. [2018-11-23 12:53:44,813 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states. [2018-11-23 12:53:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:44,816 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 12:53:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 12:53:44,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:44,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:44,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:44,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:53:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 12:53:44,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-11-23 12:53:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:44,821 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 12:53:44,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:53:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 12:53:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:53:44,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:44,822 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:44,823 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:44,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1754257002, now seen corresponding path program 1 times [2018-11-23 12:53:44,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:44,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:44,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:44,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {114#true} call ULTIMATE.init(); {114#true} is VALID [2018-11-23 12:53:44,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {114#true} assume true; {114#true} is VALID [2018-11-23 12:53:44,953 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {114#true} {114#true} #30#return; {114#true} is VALID [2018-11-23 12:53:44,954 INFO L256 TraceCheckUtils]: 3: Hoare triple {114#true} call #t~ret1 := main(); {114#true} is VALID [2018-11-23 12:53:44,954 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#true} ~i~0 := 0; {116#(<= main_~i~0 0)} is VALID [2018-11-23 12:53:44,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {116#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {117#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:44,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {117#(<= main_~i~0 1)} assume 3 != ~i~0; {117#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:44,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {117#(<= main_~i~0 1)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {118#(<= main_~i~0 2)} is VALID [2018-11-23 12:53:44,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {118#(<= main_~i~0 2)} assume !(3 != ~i~0); {115#false} is VALID [2018-11-23 12:53:44,980 INFO L256 TraceCheckUtils]: 9: Hoare triple {115#false} call __blast_assert(); {115#false} is VALID [2018-11-23 12:53:44,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {115#false} assume !false; {115#false} is VALID [2018-11-23 12:53:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:44,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:44,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:53:44,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:45,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:45,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {114#true} call ULTIMATE.init(); {114#true} is VALID [2018-11-23 12:53:45,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {114#true} assume true; {114#true} is VALID [2018-11-23 12:53:45,196 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {114#true} {114#true} #30#return; {114#true} is VALID [2018-11-23 12:53:45,197 INFO L256 TraceCheckUtils]: 3: Hoare triple {114#true} call #t~ret1 := main(); {114#true} is VALID [2018-11-23 12:53:45,198 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#true} ~i~0 := 0; {116#(<= main_~i~0 0)} is VALID [2018-11-23 12:53:45,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {116#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {117#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:45,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {117#(<= main_~i~0 1)} assume 3 != ~i~0; {117#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:45,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {117#(<= main_~i~0 1)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {118#(<= main_~i~0 2)} is VALID [2018-11-23 12:53:45,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {118#(<= main_~i~0 2)} assume !(3 != ~i~0); {115#false} is VALID [2018-11-23 12:53:45,212 INFO L256 TraceCheckUtils]: 9: Hoare triple {115#false} call __blast_assert(); {115#false} is VALID [2018-11-23 12:53:45,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {115#false} assume !false; {115#false} is VALID [2018-11-23 12:53:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:45,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:45,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 12:53:45,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 12:53:45,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:45,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:53:45,265 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 12:53:45,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:53:45,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:53:45,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:45,267 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 12:53:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:45,390 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 12:53:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:45,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 12:53:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 12:53:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 12:53:45,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2018-11-23 12:53:45,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:45,545 INFO L225 Difference]: With dead ends: 18 [2018-11-23 12:53:45,545 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 12:53:45,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 12:53:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 12:53:45,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:45,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 14 states. [2018-11-23 12:53:45,691 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 14 states. [2018-11-23 12:53:45,691 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 14 states. [2018-11-23 12:53:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:45,693 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 12:53:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 12:53:45,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:45,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:45,696 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states. [2018-11-23 12:53:45,697 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states. [2018-11-23 12:53:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:45,702 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 12:53:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 12:53:45,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:45,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:45,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:45,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:53:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 12:53:45,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-23 12:53:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:45,706 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 12:53:45,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:53:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 12:53:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:53:45,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:45,708 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:45,708 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:45,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2083501651, now seen corresponding path program 2 times [2018-11-23 12:53:45,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:45,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:45,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:45,769 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #30#return; [?] CALL call #t~ret1 := main(); [?] ~i~0 := 0; VAL [main_~i~0=0] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=1] [?] assume 3 != ~i~0; VAL [main_~i~0=1] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2] [?] assume 3 != ~i~0; VAL [main_~i~0=2] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3] [?] assume !(3 != ~i~0); VAL [main_~i~0=3] [?] CALL call __blast_assert(); [?] assume !false; [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] assume 3 != ~i~0; VAL [~i~0=1] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] assume 3 != ~i~0; VAL [~i~0=2] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] assume !(3 != ~i~0); VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] assume 3 != ~i~0; VAL [~i~0=1] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] assume 3 != ~i~0; VAL [~i~0=2] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] assume !(3 != ~i~0); VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=1] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=2] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] COND FALSE !(3 != ~i~0) VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=1] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=2] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] COND FALSE !(3 != ~i~0) VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=1] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=2] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] COND FALSE !(3 != ~i~0) VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=1] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=2] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] COND FALSE !(3 != ~i~0) VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; [L12] int i=0; VAL [i=0] [L13] COND TRUE i<5 [L14] i++ VAL [i=1] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=1] [L13] COND TRUE i<5 [L14] i++ VAL [i=2] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=2] [L13] COND TRUE i<5 [L14] i++ VAL [i=3] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=3] [L16] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 12:53:45,806 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:53:45,806 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 12:53:45,806 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 12:53:45,807 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:45,807 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:45,807 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:53:45,807 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:53:45,807 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 12:53:45,807 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:45,810 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:45,810 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 12:53:45,810 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 12:53:45,810 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 12:53:45,810 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 12:53:45,810 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:53:45,811 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 12:53:45,811 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 12:53:45,811 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 12:53:45,811 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:53:45,811 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 12:53:45,811 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 12:53:45,812 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:53:45,812 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 12:53:45,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:53:45 BoogieIcfgContainer [2018-11-23 12:53:45,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:53:45,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:53:45,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:53:45,817 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:53:45,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:43" (3/4) ... [2018-11-23 12:53:45,822 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 #30#return; [?] CALL call #t~ret1 := main(); [?] ~i~0 := 0; VAL [main_~i~0=0] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=1] [?] assume 3 != ~i~0; VAL [main_~i~0=1] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2] [?] assume 3 != ~i~0; VAL [main_~i~0=2] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3] [?] assume !(3 != ~i~0); VAL [main_~i~0=3] [?] CALL call __blast_assert(); [?] assume !false; [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] assume 3 != ~i~0; VAL [~i~0=1] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] assume 3 != ~i~0; VAL [~i~0=2] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] assume !(3 != ~i~0); VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] assume 3 != ~i~0; VAL [~i~0=1] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] assume 3 != ~i~0; VAL [~i~0=2] [L13-L20] assume !!(~i~0 < 5); [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] assume !(3 != ~i~0); VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=1] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=2] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] COND FALSE !(3 != ~i~0) VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=1] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=2] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] COND FALSE !(3 != ~i~0) VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=1] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=2] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] COND FALSE !(3 != ~i~0) VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0; VAL [~i~0=0] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=1] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=1] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=2] [L16] COND TRUE 3 != ~i~0 VAL [~i~0=2] [L13-L20] COND FALSE !(!(~i~0 < 5)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := 1 + #t~post0; [L14] havoc #t~post0; VAL [~i~0=3] [L16] COND FALSE !(3 != ~i~0) VAL [~i~0=3] [L16] CALL call __blast_assert(); [L6] assert false; [L12] int i=0; VAL [i=0] [L13] COND TRUE i<5 [L14] i++ VAL [i=1] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=1] [L13] COND TRUE i<5 [L14] i++ VAL [i=2] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=2] [L13] COND TRUE i<5 [L14] i++ VAL [i=3] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=3] [L16] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 12:53:45,904 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test_while_int_true-termination.c_false-unreach-call_1.i-witness.graphml [2018-11-23 12:53:45,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:53:45,906 INFO L168 Benchmark]: Toolchain (without parser) took 2998.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -674.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:45,908 INFO L168 Benchmark]: CDTParser took 0.21 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 12:53:45,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.24 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 12:53:45,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.41 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 12:53:45,910 INFO L168 Benchmark]: Boogie Preprocessor took 23.18 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 12:53:45,910 INFO L168 Benchmark]: RCFGBuilder took 467.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:45,911 INFO L168 Benchmark]: TraceAbstraction took 2116.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: 92.7 MB). Peak memory consumption was 92.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:45,912 INFO L168 Benchmark]: Witness Printer took 87.51 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 12:53:45,916 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.21 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 273.24 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.41 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.18 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 467.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2116.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: 92.7 MB). Peak memory consumption was 92.7 MB. Max. memory is 7.1 GB. * Witness Printer took 87.51 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i=0; VAL [i=0] [L13] COND TRUE i<5 [L14] i++ VAL [i=1] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=1] [L13] COND TRUE i<5 [L14] i++ VAL [i=2] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=2] [L13] COND TRUE i<5 [L14] i++ VAL [i=3] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=3] [L16] CALL __blast_assert () [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. UNSAFE Result, 2.0s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 3 SDslu, 38 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred 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.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 456 SizeOfPredicates, 1 NumberOfNonLiveVariables, 25 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...