java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:25:22,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:25:22,897 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:25:22,912 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:25:22,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:25:22,914 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:25:22,916 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:25:22,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:25:22,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:25:22,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:25:22,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:25:22,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:25:22,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:25:22,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:25:22,928 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:25:22,929 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:25:22,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:25:22,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:25:22,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:25:22,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:25:22,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:25:22,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:25:22,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:25:22,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:25:22,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:25:22,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:25:22,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:25:22,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:25:22,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:25:22,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:25:22,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:25:22,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:25:22,961 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:25:22,961 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:25:22,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:25:22,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:25:22,964 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:25:22,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:25:22,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:25:22,999 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:25:22,999 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:25:23,001 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:25:23,001 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:25:23,002 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:25:23,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:25:23,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:25:23,002 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:25:23,004 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:25:23,004 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:25:23,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:25:23,005 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:25:23,005 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:25:23,005 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:25:23,005 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:25:23,006 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:25:23,006 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:25:23,006 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:25:23,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:25:23,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:25:23,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:25:23,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:25:23,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:23,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:25:23,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:25:23,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:25:23,010 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:25:23,010 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:25:23,010 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:25:23,011 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:25:23,011 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:25:23,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:25:23,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:25:23,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:25:23,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:25:23,122 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:25:23,123 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i [2018-11-23 11:25:23,223 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aefa4f7/bcffb1d2d28b4dbeb5b90921b5a57585/FLAG69d17df53 [2018-11-23 11:25:23,762 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:25:23,763 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i [2018-11-23 11:25:23,770 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aefa4f7/bcffb1d2d28b4dbeb5b90921b5a57585/FLAG69d17df53 [2018-11-23 11:25:24,098 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aefa4f7/bcffb1d2d28b4dbeb5b90921b5a57585 [2018-11-23 11:25:24,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:25:24,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:25:24,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:24,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:25:24,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:25:24,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e55024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24, skipping insertion in model container [2018-11-23 11:25:24,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:25:24,168 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:25:24,526 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:24,535 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:25:24,565 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:24,588 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:25:24,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24 WrapperNode [2018-11-23 11:25:24,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:24,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:24,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:25:24,593 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:25:24,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:24,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:25:24,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:25:24,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:25:24,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... [2018-11-23 11:25:24,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:25:24,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:25:24,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:25:24,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:25:24,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:25:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:25:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:25:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:25:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:25:24,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:25:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:25:24,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:25:25,264 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:25:25,265 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:25:25,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:25 BoogieIcfgContainer [2018-11-23 11:25:25,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:25:25,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:25:25,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:25:25,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:25:25,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:25:24" (1/3) ... [2018-11-23 11:25:25,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ba6bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:25, skipping insertion in model container [2018-11-23 11:25:25,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:24" (2/3) ... [2018-11-23 11:25:25,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ba6bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:25, skipping insertion in model container [2018-11-23 11:25:25,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:25" (3/3) ... [2018-11-23 11:25:25,275 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11_true-unreach-call_false-termination.i [2018-11-23 11:25:25,283 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:25:25,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:25:25,309 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:25:25,339 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:25:25,339 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:25:25,339 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:25:25,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:25:25,340 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:25:25,340 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:25:25,340 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:25:25,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:25:25,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:25:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 11:25:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:25:25,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:25,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:25,371 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:25,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-23 11:25:25,381 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:25,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:25,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:25,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:25,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 11:25:25,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 11:25:25,532 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2018-11-23 11:25:25,532 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-23 11:25:25,532 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~a~0;~len~0 := 0bv32;havoc ~i~0; {23#true} is VALID [2018-11-23 11:25:25,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 11:25:25,534 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~bvuge32(~len~0, 0bv32) && ~bvult32(~len~0, 5bv32) then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-23 11:25:25,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 11:25:25,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-23 11:25:25,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 11:25:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:25,538 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:25,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:25,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:25:25,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:25:25,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:25,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:25:25,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:25,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:25:25,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:25:25,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:25,601 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 11:25:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:25,674 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 11:25:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:25:25,674 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:25:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 11:25:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 11:25:25,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 11:25:26,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:26,098 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:25:26,098 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:25:26,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:25:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:25:26,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:26,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:26,157 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:26,157 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:26,160 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 11:25:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:25:26,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:26,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:26,161 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:26,161 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:26,164 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 11:25:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:25:26,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:26,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:26,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:26,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:25:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 11:25:26,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 11:25:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:26,170 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 11:25:26,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:25:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:25:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:25:26,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:26,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:26,171 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:26,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-11-23 11:25:26,172 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:26,172 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:26,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:26,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:26,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2018-11-23 11:25:26,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2018-11-23 11:25:26,377 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #39#return; {141#true} is VALID [2018-11-23 11:25:26,378 INFO L256 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret2 := main(); {141#true} is VALID [2018-11-23 11:25:26,381 INFO L273 TraceCheckUtils]: 4: Hoare triple {141#true} havoc ~a~0;~len~0 := 0bv32;havoc ~i~0; {158#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:25:26,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {158#(= main_~len~0 (_ bv0 32))} assume !(0bv8 != #t~nondet0);havoc #t~nondet0; {158#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:25:26,385 INFO L256 TraceCheckUtils]: 6: Hoare triple {158#(= main_~len~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvuge32(~len~0, 0bv32) && ~bvult32(~len~0, 5bv32) then 1bv32 else 0bv32)); {165#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:26,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {165#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {169#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:26,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {169#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {142#false} is VALID [2018-11-23 11:25:26,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {142#false} assume !false; {142#false} is VALID [2018-11-23 11:25:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:26,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:26,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:26,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:25:26,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:25:26,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:26,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:25:26,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:26,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:25:26,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:25:26,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:25:26,434 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 11:25:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:26,730 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 11:25:26,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:25:26,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:25:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:25:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 11:25:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:25:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 11:25:26,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-11-23 11:25:26,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:26,800 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:25:26,800 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:25:26,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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 11:25:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:25:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 11:25:26,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:26,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 11:25:26,809 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 11:25:26,809 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 11:25:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:26,812 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 11:25:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 11:25:26,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:26,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:26,813 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 11:25:26,813 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 11:25:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:26,815 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 11:25:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 11:25:26,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:26,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:26,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:26,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:25:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 11:25:26,818 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-23 11:25:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:26,819 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 11:25:26,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:25:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:25:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:25:26,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:26,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:26,820 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:26,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:26,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2018-11-23 11:25:26,821 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:26,821 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:26,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:26,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:27,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-23 11:25:27,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-23 11:25:27,305 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {272#true} {272#true} #39#return; {272#true} is VALID [2018-11-23 11:25:27,306 INFO L256 TraceCheckUtils]: 3: Hoare triple {272#true} call #t~ret2 := main(); {272#true} is VALID [2018-11-23 11:25:27,307 INFO L273 TraceCheckUtils]: 4: Hoare triple {272#true} havoc ~a~0;~len~0 := 0bv32;havoc ~i~0; {289#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:25:27,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#(= main_~len~0 (_ bv0 32))} assume !!(0bv8 != #t~nondet0);havoc #t~nondet0; {289#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:25:27,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {289#(= main_~len~0 (_ bv0 32))} assume !(4bv32 == ~len~0); {289#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:25:27,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {289#(= main_~len~0 (_ bv0 32))} ~a~0 := ~a~0[~len~0 := 0bv32];#t~post1 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {299#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:27,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {299#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv8 != #t~nondet0);havoc #t~nondet0; {299#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:27,319 INFO L256 TraceCheckUtils]: 9: Hoare triple {299#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvuge32(~len~0, 0bv32) && ~bvult32(~len~0, 5bv32) then 1bv32 else 0bv32)); {306#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:27,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {310#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:27,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {310#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {273#false} is VALID [2018-11-23 11:25:27,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-23 11:25:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:27,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:27,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-23 11:25:27,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {320#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {273#false} is VALID [2018-11-23 11:25:27,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {320#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:25:27,649 INFO L256 TraceCheckUtils]: 9: Hoare triple {328#(bvult main_~len~0 (_ bv5 32))} call __VERIFIER_assert((if ~bvuge32(~len~0, 0bv32) && ~bvult32(~len~0, 5bv32) then 1bv32 else 0bv32)); {324#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:25:27,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(bvult main_~len~0 (_ bv5 32))} assume !(0bv8 != #t~nondet0);havoc #t~nondet0; {328#(bvult main_~len~0 (_ bv5 32))} is VALID [2018-11-23 11:25:27,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {335#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} ~a~0 := ~a~0[~len~0 := 0bv32];#t~post1 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {328#(bvult main_~len~0 (_ bv5 32))} is VALID [2018-11-23 11:25:27,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {335#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} assume !(4bv32 == ~len~0); {335#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:27,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {335#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} assume !!(0bv8 != #t~nondet0);havoc #t~nondet0; {335#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:27,658 INFO L273 TraceCheckUtils]: 4: Hoare triple {272#true} havoc ~a~0;~len~0 := 0bv32;havoc ~i~0; {335#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:25:27,658 INFO L256 TraceCheckUtils]: 3: Hoare triple {272#true} call #t~ret2 := main(); {272#true} is VALID [2018-11-23 11:25:27,659 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {272#true} {272#true} #39#return; {272#true} is VALID [2018-11-23 11:25:27,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-23 11:25:27,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-23 11:25:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:27,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:27,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:25:27,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 11:25:27,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:27,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:25:27,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:27,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:25:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:25:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:25:27,714 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2018-11-23 11:25:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:28,167 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 11:25:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:25:28,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 11:25:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:25:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2018-11-23 11:25:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:25:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2018-11-23 11:25:28,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2018-11-23 11:25:28,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:28,323 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:25:28,323 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:25:28,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:25:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:25:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:25:28,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:28,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:28,325 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:28,325 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:28,326 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:25:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:25:28,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:28,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:28,327 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:28,327 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:25:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:28,327 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:25:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:25:28,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:28,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:28,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:28,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:25:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:25:28,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 11:25:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:28,330 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:25:28,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:25:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:25:28,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:28,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:25:28,546 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2018-11-23 11:25:28,644 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:25:28,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:25:28,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:25:28,645 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:25:28,645 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:25:28,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:25:28,646 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 21) the Hoare annotation is: true [2018-11-23 11:25:28,646 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 21) no Hoare annotation was computed. [2018-11-23 11:25:28,646 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 11:25:28,646 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 15) no Hoare annotation was computed. [2018-11-23 11:25:28,646 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 21) no Hoare annotation was computed. [2018-11-23 11:25:28,646 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2018-11-23 11:25:28,646 INFO L444 ceAbstractionStarter]: At program point L13-2(lines 13 18) the Hoare annotation is: (bvult main_~len~0 (_ bv5 32)) [2018-11-23 11:25:28,647 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 18) the Hoare annotation is: (bvult main_~len~0 (_ bv5 32)) [2018-11-23 11:25:28,647 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:25:28,647 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 11:25:28,647 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:25:28,647 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 11:25:28,648 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 11:25:28,648 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 11:25:28,650 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:25:28,652 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:25:28,652 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:25:28,652 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:25:28,653 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 11:25:28,653 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:25:28,654 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:25:28,654 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:25:28,654 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 11:25:28,654 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 11:25:28,654 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 11:25:28,655 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:25:28,655 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:25:28,655 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:25:28,655 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 11:25:28,655 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-23 11:25:28,656 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:25:28,656 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:25:28,656 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:25:28,656 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:25:28,661 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-23 11:25:28,662 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-23 11:25:28,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:25:28 BoogieIcfgContainer [2018-11-23 11:25:28,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:25:28,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:25:28,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:25:28,665 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:25:28,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:25" (3/4) ... [2018-11-23 11:25:28,671 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:25:28,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:25:28,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:25:28,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:25:28,685 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:25:28,685 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:25:28,685 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:25:28,740 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/n.c11_true-unreach-call_false-termination.i-witness.graphml [2018-11-23 11:25:28,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:25:28,741 INFO L168 Benchmark]: Toolchain (without parser) took 4628.44 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -553.2 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:25:28,742 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:25:28,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:25:28,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:25:28,744 INFO L168 Benchmark]: Boogie Preprocessor took 32.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:25:28,745 INFO L168 Benchmark]: RCFGBuilder took 604.22 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:25:28,746 INFO L168 Benchmark]: TraceAbstraction took 3398.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 180.3 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:25:28,747 INFO L168 Benchmark]: Witness Printer took 74.79 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:25:28,751 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.37 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 475.37 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 37.56 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 32.80 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 604.22 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3398.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 180.3 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. * Witness Printer took 74.79 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2018-11-23 11:25:28,759 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-23 11:25:28,759 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 Derived loop invariant: NULL - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 16 SDslu, 75 SDs, 0 SdLazy, 46 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 21 NumberOfFragments, 11 HoareAnnotationTreeSize, 13 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1086 SizeOfPredicates, 4 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...